Description https://leetcode.com/problems/find-the-difference/description/
Solution 1, use XOR
char findTheDifference(string s, string t) {
char c = 0;
for(int i=0;i<s.size();i++)
c ^= s[i];
for(int i=0;i<t.size();i++)
c ^= t[i];
return c;
}
Solution 2, sort the strings and compare.
char findTheDifference(string s, string t) {
sort(s.begin(),s.end());
sort(t.begin(),t.end());
for(int i=0; i<s.size();i++) {
if(s[i]!=t[i]) return t[i];
}
return t.back();
}
No comments:
Post a Comment