zoukankan      html  css  js  c++  java
  • PAT Advanced 1050 String Subtraction (20 分)

    Given two strings S1​​ and S2​​, S=S1​​S2​​ is defined to be the remaining string after taking all the characters in S2​​ from S1​​. Your task is simply to calculate S1​​S2​​ for any given strings. However, it might not be that simple to do it fast.

    Input Specification:

    Each input file contains one test case. Each case consists of two lines which gives S1​​ and S2​​, respectively. The string lengths of both strings are no more than 1. It is guaranteed that all the characters are visible ASCII codes and white space, and a new line character signals the end of a string.

    Output Specification:

    For each test case, print S1​​S2​​ in one line.

    Sample Input:

    They are students.
    aeiou
    

    Sample Output:

    Thy r stdnts.


    #include <iostream>
    using namespace std;
    
    int main(){
        string s1,s2,res="";
        getline(cin,s1);
        getline(cin,s2);
        for(int i=0;i<s1.length();i++){
            if(s2.find(s1[i])==s2.npos) res+=s1[i];
        }
        cout<<res;
        system("pause");
        return 0;
    }
     
  • 相关阅读:
    课后作业
    大道至简第六章读后感
    Ljava.lang.Object;@ba8a1dc
    课后作业
    大道至简第五章读后感
    课后作业加密
    动手动脑
    大道至简第四章读后感
    NEU 解题报告索引
    Aizu 解题报告索引
  • 原文地址:https://www.cnblogs.com/littlepage/p/11355652.html
Copyright © 2011-2022 走看看