立志用最少的代碼做最高效的表達

---

PAT甲級最優題解——>傳送門

---

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.

---

查詢表算法。

---

#include<bits/stdc++.h> using namespace std; int a[300]; int main() {string s1, s2; getline(cin, s1); getline(cin, s2);for(auto i : s2) a[i]++;for(auto i : s1) if(a[i] == 0) cout << i;return 0; }

---

耗時：

---

求贊哦~ (?ω?)

總結

以上是生活随笔為你收集整理的1050 String Subtraction (20 分)_10行代码AC的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。