forked from fishercoder1534/Leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path_389.java
44 lines (37 loc) · 1.05 KB
/
_389.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
package com.fishercoder.solutions;
/**
* 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 _389 {
public static class Solution1 {
public char findTheDifference(String s, String t) {
int[] counts = new int[128];
char[] schars = s.toCharArray();
char[] tchars = t.toCharArray();
for (int i = 0; i < schars.length; i++) {
counts[schars[i]]++;
}
for (int i = 0; i < tchars.length; i++) {
counts[tchars[i]]--;
}
char result = 'a';
for (int i = 0; i < 128; i++) {
if (counts[i] != 0) {
result = (char) i;
}
}
return result;
}
}
}