整数模式

Question

下面是该解决方案的外观。

---

输入Y：X 239847239
进入：3923
X为Y

的

输入序列239847239
输入X：847
X为Y的子

输入Y Y：239847239
输入X：489
X既不是子字符串也不是子Ÿ

的序列

---

以下是我做的代码原油尝试：

int main() 
{ 

    cout << "Enter Y: "; 
    vector <int> Y; 
    int Y_number; 
    cin >> Y_number; 

    cout << "Enter X: "; 
    vector <int> X; 
    cin >> X; 

    if (Y > X) 
    { 
     for(int i = 0; i < Y.size(); i++) 
     { 
      Y.push_back(Y_number); 
      if (Y.size(i) == X.size(i)) 
      { 

      } 
     } 
    } 
    else 
    { 
     cout << "X is neither substring nor subsequence of Y"; 
    } 
} 

Answer 1

也许这是你想要什么：

#include <iostream> 
#include <string> 

using namespace std; 

int main() 
{ 
    string Y, X, YY; 
    cout << "Enter Y: "; 
    cin >> Y; 
    cout << "Enter X: "; 
    cin >> X; 
    YY = Y + Y; 

    if (std::string::npos != Y.find(X)) { 
     cout << "X is substring of Y" << endl; 
    } else if (std::string::npos != YY.find(X)) { 
     cout << "X is subsequence of Y" << endl; 
    } else { 
     cout << "X is neither substring nor subsequence of Y" << endl; 
    } 
    return 0; 
} 

更新：它至少产生相同结果作为你的描述。