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.
题意:
给定两个字符串 S1 和 S2,S=S1−S2 定义为将 S1 中包含的所有在 S2 中出现过的字符删除后得到的字符串。你的任务就是计算 S1−S2。
解题思路1:
暴力循环
程序代码1:
#include<iostream>
using namespace std;
int main()
{
string s1,s2;
string res;
getline(cin,s1);
getline(cin,s2);
for (int i=0;i<s1.size();i++)
{
bool flag = true;
for (int j=0;j<s2.size();j++)
{
if (s1[i] == s2[j])
{
flag = false;
break;
}
}
if (flag)
res += s1[i];
}
cout<<res<<endl;
return 0;
}
解题思路2:
用哈希表数组统计字符串s2中出现的字符,然后遍历字符串s1,将没有出现的字符输出。
程序代码2:
#include <iostream>
using namespace std;
const int N= 100;
bool flag[N];
int main()
{
string s1, s2;
getline(cin, s1);
getline(cin, s2);
for (int i = 0; i < s2.length(); i++)
flag[s2[i]] = true;
for (int i = 0; i < s1.length(); i++)
if (!flag[s1[i]])
cout << s1[i];
cout << endl;
return 0;
}