g0301_0400.s0389_find_the_difference.Solution Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java21 Show documentation

Java-based LeetCode algorithm problem solutions, regularly updated

There is a newer version: 1.38

package g0301_0400.s0389_find_the_difference;

// #Easy #String #Hash_Table #Sorting #Bit_Manipulation #Programming_Skills_I_Day_8_String
// #Udemy_Bit_Manipulation #2022_07_13_Time_1_ms_(100.00%)_Space_42.3_MB_(48.30%)

/**
 * 389 - Find the Difference\.
 *
 * Easy
 *
 * You are given two strings `s` and `t`.
 *
 * String `t` is generated by random shuffling string `s` and then add one more letter at a random position.
 *
 * Return the letter that was added to `t`.
 *
 * **Example 1:**
 *
 * **Input:** s = "abcd", t = "abcde"
 *
 * **Output:** "e"
 *
 * **Explanation:** 'e' is the letter that was added.
 *
 * **Example 2:**
 *
 * **Input:** s = "", t = "y"
 *
 * **Output:** "y"
 *
 * **Example 3:**
 *
 * **Input:** s = "a", t = "aa"
 *
 * **Output:** "a"
 *
 * **Example 4:**
 *
 * **Input:** s = "ae", t = "aea"
 *
 * **Output:** "a"
 *
 * **Constraints:**
 *
 * *   `0 <= s.length <= 1000`
 * *   `t.length == s.length + 1`
 * *   `s` and `t` consist of lower-case English letters.
**/
public class Solution {
    public char findTheDifference(String s, String t) {
        char c = 0;
        for (char cs : s.toCharArray()) {
            c ^= cs;
        }
        for (char ct : t.toCharArray()) {
            c ^= ct;
        }
        return c;
    }
}