leetcode 389. Find the Difference
LeetCode The Find Difference
2023-09-14 09:11:53 时间
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(object): def findTheDifference(self, s, t): """ :type s: str :type t: str :rtype: str """ """ s = "abcd" t = "abcde" =>e s = "abcd" t = "abcdee" =>ee s = "abcd" t = "abcdfe" =>ef?fe? s = "a" t = "" =>a s = "ab" t = "" =>ab?ba? # use dict to map t # sub the letter of t in s """ letter_cnt = {} for c in t: if c not in letter_cnt: letter_cnt[c] = 0 letter_cnt[c] += 1 for c in s: if c in letter_cnt: letter_cnt[c] -= 1 assert letter_cnt[c] >= 0 return "".join(c*letter_cnt[c] for c in letter_cnt)
用排序:
class Solution(object): def findTheDifference(self, s, t): """ :type s: str :type t: str :rtype: str """ # abcd, abcde # afjz, abcfjz # afjx, abcfjxyz s = sorted(s) t = sorted(t) ans = "" i = j = 0 while i< len(s): if s[i] != t[j]: ans += t[j] j += 1 else: i += 1 j += 1 return ans+"".join(t[j:])
如果仅仅有一个char不一样则可以使用xor:
class Solution(object): def findTheDifference(self, s, t): """ :type s: str :type t: str :rtype: str """ # if just only one char is different ans = 0 for c in s: ans ^= ord(c) for c in t: ans ^= ord(c) return chr(ans)
class Solution(object): def findTheDifference(self, s, t): """ :type s: str :type t: str :rtype: str """ # if just only one char is different return chr(sum(ord(i) for i in t)-sum(ord(i) for i in s))
用求和也可以!
相关文章
- Java实现 LeetCode 817 链表组件(暴力)
- Java实现 LeetCode 696 计数二进制子串(暴力)
- Java实现 LeetCode 553 最优除法(思路问题)
- Java实现 LeetCode 363 矩形区域不超过 K 的最大数值和
- Java实现 LeetCode 172 阶乘后的零
- Java实现 LeetCode 52 N皇后 II
- Java实现 LeetCode 14 最长公共前缀
- Java实现 LeetCode 212 单词搜索 II
- The total number of locks exceeds the lock table size错误(已纠正)
- LeetCode(28): 实现strStr()
- Unexpected XML declaration. The XML declaration must be the first node in the document and no white
- NLP:LSTM之父眼中的深度学习十年简史《The 2010s: Our Decade of Deep Learning / Outlook on the 2020s》的参考文献
- [TroubleShootin]The backup set holds a backup of a database other than the existing 'xxdb' database.
- macOS The bottle needs the Xcode CLT to be installed
- leetcode 367. Valid Perfect Square
- git push报错 fatal: The current branch master has no upstream branch. To push the current
- 【异常】Flink整合ES出错,The implementation of the provided ElasticsearchSinkFunction is not serializable.