zoukankan      html  css  js  c++  java
  • UVA-10340 All in All

     1 #include <iostream>
     2 #include <stdlib.h>
     3 #include <string>
     4 #include <vector>
     5 #include <algorithm>
     6 #include <string.h>
     7 #include <stack>
     8 #include <unordered_map>
     9 #include <math.h>
    10 #include <iomanip>
    11 
    12 using namespace std;
    13 
    14 int main()
    15 {
    16     string input1,input2;
    17     while(cin >> input1 >> input2)
    18     {
    19         if(input1.size()>input2.size())
    20         {
    21             cout << "No" << endl;
    22             continue;
    23         }
    24         int input2_index = 0;
    25         int i;
    26         for(i = 0;i < input1.size() && input2_index < input2.size();i ++)
    27         {
    28             if(input2[input2_index] != input1[i])
    29             {
    30                 input2_index ++;
    31                 i --;
    32             }
    33             else
    34             {
    35                 input2_index ++;
    36             }
    37         //    cout << i << " " << input2_index << endl;
    38         }
    39         if(i == input1.size())
    40             cout << "Yes" << endl;
    41         else
    42             cout << "No" << endl;
    43     }
    44     return 0;
    45 }
  • 相关阅读:
    leetcode211
    leetcode209
    leetcode201
    leetcode1396
    leetcode1395
    leetcode1394
    leetcode1386
    leetcode1387
    leetcode1382
    leetcode1376
  • 原文地址:https://www.cnblogs.com/Asurudo/p/9603912.html
Copyright © 2011-2022 走看看