You are given two strings s and t.
String t is generated by random shuffling string s and then add one more letter at a random position.
Return the letter that was added to t.
Example 1:
Input: s = "abcd", t = "abcde" Output: "e" Explanation: 'e' is the letter that was added.
Example 2:
Input: s = "", t = "y" Output: "y"
Constraints:
0 <= s.length <= 1000t.length == s.length + 1s and t consist of lowercase English letters.class Solution {
public:
char findTheDifference(string s, string t) {
map <char, int> ms, mt;
for (int i=0; i < s.length(); i++)
ms[s[i]]++, mt[t[i]]++;
mt[t[t.length()-1]]++;
for (auto i:mt)
if(ms[i.first]<i.second)
return i.first;
return 'a'; // fallback
}
};