Compare two strings A and B, determine whether A contains all of the characters in B.
The characters in string A and B are all Upper Case letters.
Have you met this question in a real interview? Yes
Example
For A = “ABCD”, B = “ACD”, return true.
For A = “ABCD”, B = “AABC”, return false.
Note
The characters of B in A are not necessary continuous or ordered.
public class Solution {
/**
* @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
*/
public boolean compareStrings(String A, String B) {
if(A.length() < B.length()) return false;
Map<Character, Integer> map = new HashMap<Character, Integer>();
for(int i = 0; i < A.length(); i++) {
char c = A.charAt(i);
if(map.containsKey(c)) {
int value = map.get(c);
map.put(c, ++value);
}else {
map.put(c, 1);
}
}
for(int i = 0; i < B.length(); i++) {
char c = B.charAt(i);
if(map.containsKey(c)) {
int value = map.get(c);
if(--value < 0) return false;
map.put(c, value);
}else {
return false;
}
}
return true;
}
}