UVa 10340 子序列

https://vjudge.net/problem/UVA-10340

题意：

输入两个字符串s和t，判断是否可以从t中删除0个或多个字符得到字符串s。

思路：

很水的题...

#include<iostream> 
#include<string>
#include<cstring>
using namespace std;

string s, t;

int main()
{
    //freopen("D:\txt.txt", "r", stdin);
    while (cin >> s >> t)
    {
        int l1 = s.size();
        int l2 = t.size();
        int p1 = 0, p2 = 0;
        while (p1 < l1 && p2 < l2)
        {
            if (s[p1] == t[p2])
            {
                p1++;
                p2++;
            }
            else
                p2++;
        }
        if (p1 == l1)    cout << "Yes" << endl;
        else cout << "No" << endl;
    }
}