leetcode 389. Find the Difference

最新推荐文章于 2023-12-27 14:03:26 发布

JeremyChan1887

最新推荐文章于 2023-12-27 14:03:26 发布

阅读量202

点赞数

分类专栏： LeetCode 文章标签： leetcode java 算法

本文链接：https://blog.csdn.net/sinat_30973431/article/details/104708675

版权

LeetCode 专栏收录该内容

46 篇文章 0 订阅

订阅专栏

https://leetcode.com/problems/find-the-difference/

给定两个字符串，其中一个字符串是在另一个字符串的任意位置添加一个字母得到的，求这个字母

一、问题描述

测试用例：

Example:

Input:
s = "abcd"
t = "abcde"

Output:
e

Explanation:
'e' is the letter that was added.

字符串的元素均为小写字母

二、代码实现

1、桶排序

class Solution {
    
    //数组
    public char findTheDifference2(String s, String t) {
        int[] count = new int[26];  //HashMap, Array, Bits
        for (int i=0; i<s.length(); i++) {
            count[s.charAt(i) - 'a'] ++;
        }
        
        for (int i=0; i<t.length(); i++) {
            count[t.charAt(i) - 'a'] --;
            if (count[t.charAt(i)-'a'] == -1) {
                return t.charAt(i);
            }
        }
        
        return ' ';
    }
    
    //HashMap
    public char findTheDifference1(String s, String t) {
        HashMap<Character, Integer> map = new HashMap<>();
        for (int i=0; i<s.length(); i++) {
            char ch = s.charAt(i);
            map.put(ch, map.getOrDefault(ch, 0)+1);
        }
        
        for (int i=0; i<t.length(); i++) {
            char ch = t.charAt(i);
            if (!map.containsKey(ch)) {
                return ch;
            } else {
                if (map.get(ch) == 1) {
                    map.remove(ch);
                } else {
                    map.put(ch, map.get(ch)-1);
                }
            }
        }
        
        return ' ';
    }
}

2、异或法

class Solution {

    public char findTheDifference3(String s, String t) {
        char ret = t.charAt(t.length()-1);
        
        for (int i=0; i<s.length(); i++) {
            ret ^= s.charAt(i) ^ t.charAt(i); //c ^= s.chartAt(i); 等同于 c = (char)((int)c ^ (int)s.charAt(i));
        }
        
        return ret;
    }
  
}

3、求和法

class Solution {
    
    public char findTheDifference4(String s, String t) {
        int sum = t.charAt(t.length()-1);
        
        for (int i=0; i<s.length(); i++) {
            sum = (sum - s.charAt(i) + t.charAt(i));
        }
        
        return (char)sum;
    }
  
}

参考：

https://leetcode.com/problems/find-the-difference/discuss/86850/Simple-JAVA-8ms-solution-4-lines

https://leetcode.com/problems/find-the-difference/discuss/86913/JavaC%2B%2B-1-liner

https://leetcode.com/problems/find-the-difference/discuss/87049/Simple-Java-Solution-Bit-Manipulation-5ms

https://leetcode.com/problems/find-the-difference/discuss/87095/Two-Java-Solutions-using-XOR-Sum

https://leetcode.com/problems/find-the-difference/discuss/86825/Java-solution-using-bit-manipulation

https://leetcode.com/problems/find-the-difference/discuss/87114/simple-cpp-solution

https://leetcode.com/problems/find-the-difference/discuss/86844/Java-Solution-using-array%3A-6ms

https://leetcode.com/problems/find-the-difference/discuss/87051/easy-Java-O(n)-solution-using-map