【PAT】A1050 String Subtraction【散列】

最新推荐文章于 2023-11-26 15:20:00 发布

昵称五个字

最新推荐文章于 2023-11-26 15:20:00 发布

阅读量582

点赞数

分类专栏： PAT

本文链接：https://blog.csdn.net/a617976080/article/details/94602420

版权

PAT 专栏收录该内容

163 篇文章 51 订阅

订阅专栏

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.

题意

给出两个字符串，输出第一个字符串删去第二个字符串中的所有字符的结果。

思路

最简单的散列题，注意字符串有空格，输入需要使用fgets。

#include <cstdio>
#include <cstring>
// 最大长度10^4，再加上行末的\n和字符串结尾的\0，所以最大长度定位10^4 + 2
#define MAX_LENGTH 10002
#define L 256
int main() {
    char str1[MAX_LENGTH], str2[MAX_LENGTH];
    bool marked[L] = {false};
    fgets(str1, MAX_LENGTH, stdin);
    fgets(str2, MAX_LENGTH, stdin);
    
    // 遍历标记删去的字符
    for(int i = 0, l = (int)strlen(str2); i < l; i++){
        marked[str2[i]] = true;
    }
    
    // 遍历输出
    for(int i = 0, l = (int)strlen(str1); i < l; i++){
        if(marked[str1[i]]) continue;
        putchar(str1[i]);
    }
    return 0;
}