日期:2017-7-11
思路:两层循环,若有相同的数,则删除,最后比较相同的数量与B的长度是否相等,相等则包含,不相等则不包含
*/
#include <iostream> #include <string> using namespace std; class CompareString{ public: /** * @param A: A string includes Upper Case letters * @param B: A string includes Upper Case letter * @return: if string A contains all of the characters in B return true * else return false */ bool compareStrings(string A, string B) { // write your code here bool is = false; int count = 0; for (int i = 0; i < B.size(); i++) { for (int j = 0; j < A.size(); j++) { if (B[i] == A[j]) { A[j] = '*'; count++; break; } } } if (count == B.size()) is = true; return is; } };