zoukankan      html  css  js  c++  java
  • 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 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 <map>
    #include <queue>
    #include <stdio.h>
    #include <vector>
    #include <algorithm>
    #include <stack>
    #include <stdlib.h>
    #include <string.h>
    #include <math.h>
    #include <string>
    using namespace std;
    
    #include<iostream>
    #include<vector>
    
    int has[10000];
    
    int main(){
    //	freopen("C:\Users\Administrator\Desktop\in.txt","r",stdin);
    	string s;
    	string c;
    	while(getline(cin,s)){
    		memset(has,0,sizeof(has));
    		getline(cin,c);
    		int ls=s.length();
    		int lc=c.length();
    		string temp="";
    		int flag=0;
    		for(int i=0;i<lc;i++){
    			has[c[i]]=1;
    		}
    		for(int j=0;j<ls;j++){
    			if(has[s[j]]==0){
    				temp+=s[j];
    			}
    		}
    		cout<<temp<<endl;
    	}
    	return 0;
    }


  • 相关阅读:
    前端工程师如何打发闲余时光?(转)
    比较好的前端开发工具
    蓝桥历年套题 约数倍数选卡片 博弈
    单调栈求全1(或全0)子矩阵的个数 洛谷P5300与或和 P3400仓鼠窝
    5-15
    2018CCPC桂林站G Greatest Common Divisor
    STL中的BITSET运用
    2018CCPC桂林站JStone Game
    牛客2019湘潭大学程序竞赛
    Combine String HDU
  • 原文地址:https://www.cnblogs.com/zh9927/p/4099044.html
Copyright © 2011-2022 走看看