1050. String Subtraction (20)-PAT甲级真题(哈希)
2016-08-08 03:41
531 查看
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.
题目大意:给出两个字符串,在第一个字符串中删除第二个字符串中出现过的所有字符并输出。
分析:用flag[256]数组变量标记str2出现过的字符为true,输出str1的时候根据flag[str1[i]]是否为true,如果是true就不输出
使用:int lens1 = strlen(s1);
int lens2 = strlen(s2);否则直接放在for循环里面会超时~
#include <string>
#include <iostream>
#include <cstdio>
#include <string.h>
using namespace std;
char s1[100000], s2[100000];
int main() {
cin.getline(s1, 100000);
cin.getline(s2, 100000);
int lens1 = strlen(s1);
int lens2 = strlen(s2);
bool flag[256] = {false};
for(int i = 0; i < lens2; i++) {
flag[s2[i]] = true;
}
for(int i = 0; i < lens1; i++) {
if(!flag[s1[i]])
printf("%c", s1[i]);
}
return 0;
}
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.
题目大意:给出两个字符串,在第一个字符串中删除第二个字符串中出现过的所有字符并输出。
分析:用flag[256]数组变量标记str2出现过的字符为true,输出str1的时候根据flag[str1[i]]是否为true,如果是true就不输出
使用:int lens1 = strlen(s1);
int lens2 = strlen(s2);否则直接放在for循环里面会超时~
#include <string>
#include <iostream>
#include <cstdio>
#include <string.h>
using namespace std;
char s1[100000], s2[100000];
int main() {
cin.getline(s1, 100000);
cin.getline(s2, 100000);
int lens1 = strlen(s1);
int lens2 = strlen(s2);
bool flag[256] = {false};
for(int i = 0; i < lens2; i++) {
flag[s2[i]] = true;
}
for(int i = 0; i < lens1; i++) {
if(!flag[s1[i]])
printf("%c", s1[i]);
}
return 0;
}
相关文章推荐
- 1108. Finding Average (20)-PAT甲级真题
- 1081. Rational Sum (20)-PAT甲级真题
- 1031. Hello World for U (20)-PAT甲级真题
- PAT甲级真题及训练集(12)--1019. General Palindromic Number (20)
- 1069. The Black Hole of Numbers (20)-PAT甲级真题
- 1061. Dating (20)-PAT甲级真题
- 1077. Kuchiguse (20)-PAT甲级真题
- 1096. Consecutive Factors (20)-PAT甲级真题
- 1042. Shuffling Machine (20)-PAT甲级真题
- PAT甲级真题及训练集(1)--1046. Shortest Distance (20)
- PAT甲级真题及训练集(11)--1031. Hello World for U (20)
- PAT甲级真题及训练集(15)--1005. Spell It Right (20)
- 1120. Friend Numbers (20)-PAT甲级真题
- PAT甲级真题及训练集(2)--1065. A+B and C (64bit) (20)
- PAT甲级真题及训练集(13)--1027. Colors in Mars (20)
- 1120. Friend Numbers (20)-PAT甲级真题
- 1046. Shortest Distance (20)-PAT甲级真题
- 1011. World Cup Betting (20)-PAT甲级真题
- PAT甲级真题及训练集(14)--1058. A+B in Hogwarts (20)
- 1088. Rational Arithmetic (20)-PAT甲级真题