poj 1936 字符匹配

继续做简单题

给定两个字符串，看第一个是不是第二个顺序子串

#include <iostream>#include <sstream>#include <cstdio>#include <cstring>#include <cmath>#include <string>#include <vector>#include <set>#include <cctype>#include <algorithm>#include <cmath>#include <deque>#include <queue>#include <map>#include <queue>#include <list>#include <iomanip>using namespace std;                                               //////const int INF =  20000000;   #define maxn 55   #define max(a,b)(a>b?a:b)///string s1, t1;int main(){///int i, j;while (cin >> s1 >> t1){int maxpos = 0;int lens1 = s1.length();int lens2 = t1.length();if (lens2 < lens1){cout << "No" << endl;continue;}i = 0;j = i;while (i < lens1){for (; j < lens2; j++){if (t1[j] == s1[i])break;}if (j == lens2)break;j++;i++;}if (i == lens1)cout << "Yes" << endl;elsecout << "No" << endl;}///    return 0;}