UVa 10340 - All in All

传送门UVa 10340 - All in All


题意:查找str中有没有包含substr。

思路:偷懒,直接用string,根据substr一直往前查找,如果能找完substr,YES。反之则no


#include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;

int main()
{
    //freopen("input.txt", "r", stdin);
    string sub, str;
    int i, j, temp;
    bool flag;
    while (cin >> sub >> str)
    {
        flag = true;
        temp = -1;
        for (i = 0; i < sub.size(); i++)
        {
            char ch = sub[i];
            size_t si = str.find(ch, temp + 1);
            if (si == string::npos)
            {
                flag = false;
                break;
            }
            temp = si;
        }
        if (flag)
            printf("Yes\n");
        else
            printf("No\n");
    }
    return 0;
}






你可能感兴趣的:(ACM,uva)