您的位置 首页 JAVA(2017)

LeetCode – 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.

 

public class Solution {
    public char findTheDifference(String s, String t) {
        int[] chars = new int[26];
        for(int i=0;i<s.length();i++){
            chars[s.charAt(i) - 'a']++;
        }
        for(int i=0;i<t.length();i++){
            chars[t.charAt(i) - 'a'] --;
            if(chars[t.charAt(i) - 'a'] <0){
                return t.charAt(i);
            }
        }
        return 0;
    }
}
看完了?留个评分呗?
[0人评了分,平均: 0/5]

本站原创文章皆遵循“署名-非商业性使用-相同方式共享 3.0 (CC BY-NC-SA 3.0)”。转载请保留以下标注:

原文来源:《LeetCode – 389. Find the Difference》

发表评论

邮箱地址不会被公开。

返回顶部