1050 String Subtraction (20)

本文介绍了一种计算两个字符串差集的简单算法,并提供了一个C++实现示例。该算法通过使用字符映射的方式快速地从第一个字符串中移除第二个字符串中存在的字符。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

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.

注意点:连个字符串都可能包含空格, 要用getline输入
#include<iostream>
#include<vector>
using namespace std;
int main(){
  string s, s1;
  getline(cin, s);
  getline(cin, s1);
  int i;
  vector<int> v(128,-1);
  for(i=0; i<s1.size(); i++) v[s1[i]] = 1;
  for( i=0; i<s.size(); i++)
  if(v[s[i]]!=1) cout<<s[i];
  return 0;
}

 

转载于:https://www.cnblogs.com/mr-stn/p/9178768.html

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值