1050 String Subtraction (20 分)

字符串减法算法
本文介绍了一个简单的字符串减法算法问题,即从一个字符串中移除另一个字符串中的所有字符。通过使用128大小的数组来标记ASCII字符是否需要被删除,并利用getline函数正确处理输入中的空格与换行。

1050 String Subtraction (20 分)

Given two strings S​1​​ and S​2​​, S=S​1​​−S​2​​ is defined to be the remaining string after taking all the characters in S​2​​ from S​1​​. Your task is simply to calculate S​1​​−S​2​​ 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 S​1​​ and S​2​​, respectively. The string lengths of both strings are no more than 10​4​​. 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 S​1​​−S​2​​ in one line.

Sample Input:

They are students.
aeiou

Sample Output:

Thy r stdnts.

 

解题思路:1.ASCII码工128个 十进制由0-127 因此用一个128大小的数组存足以

2.注意输入函数:getline(cin,str)可以接收空格,换行符结束;而普通cin和getline都不能接受空格

3.如果使用erase函数,i会改变,不妥

#include <iostream>
#include <bits/stdc++.h>
using namespace std;

int vis[128];//ASCII码工128个字符 十进制0到127

int main()
{
    string s1,s2,ans;
    getline(cin,s1);
    getline(cin,s2);
    memset(vis,0,sizeof(vis));
    for(int i = 0; i < s2.size(); i++){
        vis[s2[i]] = 1;
    }
    for(int i = 0; i < s1.size(); i++){
        if(!vis[s1[i]]){
            ans += s1[i];
        }
    }
    cout << ans;
    return 0;
}

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值