forked from haoel/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
fix: forgot commit the "Find the Difference"
- Loading branch information
Showing
1 changed file
with
38 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,38 @@ | ||
// Source : https://leetcode.com/problems/find-the-difference/ | ||
// Author : Hao Chen | ||
// Date : 2016-09-08 | ||
|
||
/*************************************************************************************** | ||
* | ||
* Given two strings s and t which consist of only lowercase letters. | ||
* | ||
* String t is generated by random shuffling string s and then add one more letter at a | ||
* random position. | ||
* | ||
* Find the letter that was added in t. | ||
* | ||
* Example: | ||
* | ||
* Input: | ||
* s = "abcd" | ||
* t = "abcde" | ||
* | ||
* Output: | ||
* e | ||
* | ||
* Explanation: | ||
* 'e' is the letter that was added. | ||
***************************************************************************************/ | ||
|
||
class Solution { | ||
public: | ||
char findTheDifference(string s, string t) { | ||
unordered_map<char, int> m; | ||
for(auto c : s) m[c]++; | ||
for(auto c : t) { | ||
m[c]--; | ||
if (m[c] < 0) return c; | ||
} | ||
return '\0'; | ||
} | ||
}; |