-
Notifications
You must be signed in to change notification settings - Fork 0
/
find-anagrams.js
80 lines (67 loc) · 1.96 KB
/
find-anagrams.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
79
80
/**
* @description https://leetcode.com/problems/find-all-anagrams-in-a-string/description/
* @param {string} s
* @param {string} p
* @return {number[]}
*/
var findAnagrams = function(s, p) {
var ans = [];
var begin = 0;
var end = 0;
var sLen = s.length;
var pLen = p.length;
var table = {};
var counter = 0;
var endChar = "";
var startChar = "";
// create a letter frequency table
for (var i = 0; i < pLen; i++) {
if (table[p[i]]) {
table[p[i]]++;
} else {
table[p[i]] = 1;
counter++;
}
}
// console.log("table: ", table);
// console.log("counter: ", counter, "\n");
while (end < sLen) {
// console.log("\nIteration 'end' = ", end, "'begin' = ", begin);
endChar = s[end];
// console.log("endChar:", endChar);
if (table[endChar] !== undefined) {
table[endChar]--;
if (table[endChar] === 0) counter--;
}
// console.log("table: ", table);
// console.log("counter: ", counter, "\n");
while (counter === 0) {
// console.log("end-begin:", end-begin+1, ", pLen:", pLen);
if (end-begin+1 == pLen) {
ans.push(begin);
// console.log("ans:", begin);
}
startChar = s[begin];
if (table[startChar] !== undefined) {
table[startChar]++;
if (table[startChar] > 0) counter++;
}
begin++;
}
end++;
}
return ans;
};
// console.clear();
// var S = "cbaebabacd";
// var P = "abc";
// console.log("\n***************************");
// console.log("findAnagrams:", S, P, "\n");
// console.log(findAnagrams(S, P));
// console.log("\n");
// var S1 = "abab";
// var P1 = "ab";
// console.log("\n***************************");
// console.log("findAnagrams:", S1, P1, "\n");
// console.log(findAnagrams(S1, P1));
// console.log("\n");