从零开始的LC刷题(81): Find the Difference

最新推荐文章于 2024-01-26 10:43:17 发布

クロネコ黒猫

最新推荐文章于 2024-01-26 10:43:17 发布

阅读量318

点赞数 1

CC 4.0 BY-SA版权

分类专栏： LEETCODE C++ 文章标签： lc

本文链接：https://blog.youkuaiyun.com/cyr429/article/details/93190932

LEETCODE C++ 专栏收录该内容

134 篇文章

订阅专栏

博客围绕一道编程题展开，题目要求在由字符串s随机打乱并随机添加一个字母得到的字符串t中，找出新增的字母。作者联想到按位异或数字找数字的方法解题，给出了C++代码，运行结果显示时间和内存表现良好。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

原题：

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.

找到t中多出来的字母，顺序是乱序，看到这道题我一下子就想起来了上次那个按位异或数字找一个数字的题，详细说明可以参考这个：

https://blog.youkuaiyun.com/cyr429/article/details/90640938

结果：

Success

Runtime: 0 ms, faster than 100.00% of C++ online submissions for Find the Difference.

Memory Usage: 8.8 MB, less than 94.22% of C++ online submissions for Find the Difference.

代码：

class Solution {
public:
    char findTheDifference(string s, string t) {
        char res=t.back();
        for(int i=0;i<s.size();i++){
            res^=s[i]^t[i];
        }
        return res;
    }
};