forked from JiauZhang/algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path0389_find_the_difference.cpp
54 lines (51 loc) · 1.53 KB
/
0389_find_the_difference.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
/*
* Copyright(c) 2019 Jiau Zhang
* For more information see <https://github.com/JiauZhang/algorithms>
*
* This repo is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation
*
* It is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with THIS repo. If not, see <http://www.gnu.org/licenses/>.
*/
/*
* https://leetcode-cn.com/problems/find-the-difference
* 题目描述:
* 给定两个字符串 s 和 t,它们只包含小写字母
* 字符串 t 由字符串 s 随机重排,然后在随机位置添加一个字母
* 请找出在 t 中被添加的字母
*
*
* 示例:
* 输入:
* s = "abcd"
* t = "abcde"
* 输出:
* e
*
* 解释:
* 'e' 是那个被添加的字母。
*
* 解题思路:
* 1. 可以使用映射统计每个字符的数量,然后相减,剩下的一个就是
* 要找的字符
* 2. 由于两个字符串只有一个不同,所以可以通过异或找出唯一的
* 那一个
*/
class Solution {
public:
char findTheDifference(string s, string t) {
char res = 0;
for (int i=0; i<s.size(); i++) {
res ^= (s[i]^t[i]);
}
res ^= t[t.size()-1];
return res;
}
};