feat: add typescript solution to lc problem: No.0003.Longest Substring Without Repeating Characters (doocs#505)

zhaocchen · web-flow · commit a9e84ffa1a67 · 2021-07-08T21:13:51.000+08:00
diff --git a/solution/0000-0099/0003.Longest Substring Without Repeating Characters/README.md b/solution/0000-0099/0003.Longest Substring Without Repeating Characters/README.md
@@ -106,6 +106,26 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function lengthOfLongestSubstring(s: string): number {
+    // 滑动窗口+哈希表
+    let left = -1;
+    let maxLen = 0;
+    let hashTable = new Map();
+    for (let right = 0; right < s.length; right++) {
+        let cur = s.charAt(right);
+        if (hashTable.has(cur)) {
+          left = Math.max(left, hashTable.get(cur));
+        }
+        hashTable.set(cur, right);
+        maxLen = Math.max(maxLen, right - left);
+    }
+      return maxLen;
+  };
+```
+
 ### **Swift**
 
 ```swift
diff --git a/solution/0000-0099/0003.Longest Substring Without Repeating Characters/README_EN.md b/solution/0000-0099/0003.Longest Substring Without Repeating Characters/README_EN.md
@@ -88,6 +88,26 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function lengthOfLongestSubstring(s: string): number {
+    // 滑动窗口+哈希表
+    let left = -1;
+    let maxLen = 0;
+    let hashTable = new Map();
+    for (let right = 0; right < s.length; right++) {
+        let cur = s.charAt(right);
+        if (hashTable.has(cur)) {
+          left = Math.max(left, hashTable.get(cur));
+        }
+        hashTable.set(cur, right);
+        maxLen = Math.max(maxLen, right - left);
+    }
+      return maxLen;
+  };
+```
+
 ### **Swift**
 
 ```swift
diff --git a/solution/0000-0099/0003.Longest Substring Without Repeating Characters/Solution.ts b/solution/0000-0099/0003.Longest Substring Without Repeating Characters/Solution.ts
@@ -0,0 +1,15 @@
+function lengthOfLongestSubstring(s: string): number {
+    // 滑动窗口+哈希表
+    let left = -1;
+    let maxLen = 0;
+    let hashTable = new Map();
+    for (let right = 0; right < s.length; right++) {
+        let cur = s.charAt(right);
+        if (hashTable.has(cur)) {
+          left = Math.max(left, hashTable.get(cur));
+        }
+        hashTable.set(cur, right);
+        maxLen = Math.max(maxLen, right - left);
+    }
+      return maxLen;
+  };
