zoukankan      html  css  js  c++  java
  • 浙江大学PAT上机题解析之1050. String Subtraction (20)

    1050. String Subtraction (20)

    时间限制 
    10 ms
    内存限制 
    32000 kB
    代码长度限制 
    16000 B
    判题程序   
    Standard

    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 104.  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>
    #include <string>
    #include <vector>
    #include <algorithm>
    
    using namespace std;
    
    string str1;
    string str2;
    
    string::iterator it1,it2;
    
    bool compare(char ch)
    {
    	for (it2=str2.begin();it2!=str2.end();it2++)
    		if (ch == *it2)
    		return true;
    return false;
    }
    
    
    int main()
    {
    
     getline(cin,str1);
     getline(cin,str2);
    
     sort(str2.begin(),str2.end());
    
     str2.erase(unique(str2.begin(),str2.end()),str2.end());
    
    str1.resize(remove_if(str1.begin(),str1.end(),compare) - str1.begin());
    
     cout<<str1<<endl;
    
      //system("pause");
    	return 0;
    }

     
     
  • 相关阅读:
    CentOS安装配置Tomcat-7
    CentOS搭建VSFTP服务器
    使用DDMS测试安卓手机APP的性能(android)
    Linux常见问题及解决方案
    数据库版本控制工具:NeXtep Designer
    身份证号码编码规则
    无网络安装mysql步骤
    HTTP协议详解
    Jenkins持续集成构建
    Gulp和Webpack对比
  • 原文地址:https://www.cnblogs.com/ainima/p/6331277.html
Copyright © 2011-2022 走看看