zoukankan      html  css  js  c++  java
  • PAT 解题报告 1050. String Subtraction (20)

    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,要求将 S2 中的字符从 S1 串中剔除。

    分析

    用 Hash 的方式标记需要剔除的字符。

    #include <iostream>
    #include <cstdio>
    #include <string>
    
    using namespace std;
    
    int main()
    {
        int hs[256] ={0};
        char cs[10001];
        gets(cs);
        string st = cs;
        //getline(cin, st);
        while (1) {
            char c = getchar();
            if (c == '
    ') break;
            hs[c] = 1;
        }
    
        for (int i=0; i<st.size(); i++) {
            if (hs[st[i]] == 0)
                printf("%c", st[i]);
        }
    
        return 0;
    }
  • 相关阅读:
    vj p1034题解
    2010.11.9南高模拟赛
    vj p1041神风堂人数 题解
    noi99钉子和小球 解题报告
    vj p1032题解
    vj p1037题解
    vj p1040题解
    vj p1038题解
    vj p1042捕风捉影 题解
    vj p1046 观光旅游 题解
  • 原文地址:https://www.cnblogs.com/549294286/p/3574247.html
Copyright © 2011-2022 走看看