leetcode刷题笔记(Golang)--389. Find the Difference

本文介绍了一种算法,用于找出由原字符串通过随机排列并添加一个新字母生成的目标字符串中新增的字母。通过遍历和计数的方式,有效地定位了新增的字符。

389. Find the Difference

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'
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值