389. Find the Difference

最新推荐文章于 2025-12-14 19:30:20 发布

原创最新推荐文章于 2025-12-14 19:30:20 发布 · 601 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode

算法专栏收录该内容

1 篇文章

订阅专栏

本文介绍了一种简单的算法，用于找出一个经过随机打乱并添加了一个新字符的字符串中新增加的那个字符。通过对比两个字符串中各字符出现次数的差异来定位新增的字符。

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.

难度：EASY
代码：

public class Solution {
    public char findTheDifference(String s, String t) {
        int[] counts=new int[26];
        int[] countt=new int[26];
        for (int i=0;i<s.length();i++){
            counts[s.charAt(i)-'a']++;
        }
        for (int i=0;i<t.length();i++){
            countt[t.charAt(i)-'a']++;
        }
        for (int j=0;j<26;j++){
            if (counts[j]!=countt[j]){
                return (char) (j+'a');
            }
        }
        return ' ';
    }
}