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.
func findTheDifference(s string, t string) byte {
d := make(map[rune]int)
for _, v := range s {
d[v]++
}
for i, v := range t {
if _, ok := d[v]; !ok {
return t[i]
} else {
d[v]--
if d[v] < 0 {
return t[i]
}
}
}
return '0'
}
本文介绍了一种算法,用于找出由原字符串通过随机排列并添加一个新字母生成的目标字符串中新增的字母。通过遍历和计数的方式,有效地定位了新增的字符。
232

被折叠的 条评论
为什么被折叠?



