-
Notifications
You must be signed in to change notification settings - Fork 154
/
buddy-strings.js
78 lines (69 loc) · 1.32 KB
/
buddy-strings.js
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
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
/**
* Buddy Strings
*
* Given two strings A and B of lowercase letters, return true if and only if we can
* swap two letters in A so that the result equals B.
*
* Example 1:
* Input: A = "ab", B = "ba"
* Output: true
*
* Example 2:
* Input: A = "ab", B = "ab"
* Output: false
*
* Example 3:
* Input: A = "aa", B = "aa"
* Output: true
*
* Example 4:
* Input: A = "aaaaaaabc", B = "aaaaaaacb"
* Output: true
*
* Example 5:
* Input: A = "", B = "aa"
* Output: false
*
* Note:
*
* 0 <= A.length <= 20000
* 0 <= B.length <= 20000
* A and B consist only of lowercase letters.
*/
/**
* @param {string} A
* @param {string} B
* @return {boolean}
*/
const buddyStrings = (A, B) => {
if (!A || !B || A.length !== B.length) {
return false;
}
if (A === B) {
const count = {};
for (let c of A) {
count[c] = ~~count[c] + 1;
}
for (let c in count) {
if (count[c] > 1) {
return true;
}
}
return false;
}
let first = -1;
let second = -1;
for (let i = 0; i < A.length; i++) {
if (A[i] !== B[i]) {
if (first === -1) {
first = i;
} else if (second === -1) {
second = i;
} else {
return false;
}
}
}
return second !== -1 && A[first] === B[second] && A[second] === B[first];
};
export { buddyStrings };