day-17

Author: libterty

README.md

@@ -17,3 +17,4 @@
     -   Day 14: [Implement Trie (Prefix Tree)](https://github.com/libterty/leetcode-challenge/blob/master/src/may/day-thirteen/index.ts) :pig_nose:
     -   Day 15: [Maximum Sum Circular Subarray](https://github.com/libterty/leetcode-challenge/blob/master/src/may/day-fifteen/index.ts) :whale:
     -   Day 16: [Odd Even Linked List](https://github.com/libterty/leetcode-challenge/blob/master/src/may/day-sixteen/index.ts) :whale:
+    -   Day 17: [Find All Anagrams in a String Solution](https://github.com/libterty/leetcode-challenge/blob/master/src/may/day-seventeen/index.ts) :whale:

src/may/day-seventeen/index.ts

@@ -0,0 +1,44 @@
+/**
+ * @param {string} s
+ * @param {string} p
+ * @return {number[]}
+ */
+var findAnagrams = function (s: string, p: string) {
+    let map = new Map();
+    let result: number[] = [];
+    let slideWindow = new Map();
+
+    for (var i = 0; i < p.length; i++) {
+        if (map.get(p[i])) {
+            map.set(p[i], map.get(p[i] + 1));
+        } else {
+            map.set(p[i], 1);
+        }
+    }
+
+    let right: number = 0;
+    let left: number = 0;
+
+    while (right < s.length) {
+        if (map.get(s.charAt(right))) {
+            if (slideWindow.get(s.charAt(right)) && map.get(s.charAt(right)) === 1) {
+                left = Math.max(slideWindow.get(s.charAt(right)), left);
+            }
+            if (right - left + 1 === p.length) {
+                result.push(left);
+                left++;
+            }
+        } else {
+            left = right + 1;
+            slideWindow.clear();
+        }
+        slideWindow.set(s.charAt(right), right + 1);
+        right++;
+    }
+    return result;
+};
+
+const ab = findAnagrams('cbaebabacd', 'abc');
+const bc = findAnagrams('abab', 'ab');
+console.log('ab', ab);
+console.log('bc', bc);