首页 > 其他 > 详细

Find the Difference -- LeetCode

时间:2016-08-29 06:54:08      阅读:410      评论:0      收藏:0      [点我收藏+]

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.

思路:用map记录所有char出现的次数。复杂度O(N)。

 1 class Solution {
 2 public:
 3     char findTheDifference(string s, string t) {
 4         unordered_map<char, int> dict;
 5         for (int i = 0; i < s.size(); i++)
 6             if (!dict.count(s[i])) dict.insert(make_pair(s[i], 1));
 7             else dict[s[i]]++;
 8         for (int i = 0; i < t.size(); i++)
 9             if (!dict.count(t[i]) || !dict[t[i]]) return t[i];
10             else dict[t[i]]--;
11         return \0;
12     }
13 };

 

Find the Difference -- LeetCode

原文:http://www.cnblogs.com/fenshen371/p/5816537.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!