feat: update solutions to lc/lcof2 problems (#1473)

lc No.0003 & lcof2 No.016 & lcof No.48. Longest Substring Without Repeating Characters

---------

Co-authored-by: Libin YANG <contact@yanglibin.info>

Author: thinkasany

lcof/面试题48. 最长不含重复字符的子字符串/README.md

@@ -101,6 +101,25 @@ class Solution {
 }
 ```
 
+```java
+class Solution {
+    public int lengthOfLongestSubstring(String s) {
+        boolean[] ss = new boolean[128];
+        int ans = 0, j = 0;
+        int n = s.length();
+        for (int i = 0; i < n; ++i) {
+            char c = s.charAt(i);
+            while (ss[c]) {
+                ss[s.charAt(j++)] = false;
+            }
+            ans = Math.max(ans, i - j + 1);
+            ss[c] = true;
+        }
+        return ans;
+    }
+}
+```
+
 ### **C++**
 
 ```cpp
@@ -121,6 +140,25 @@ public:
 };
 ```
 
+```cpp
+class Solution {
+public:
+    int lengthOfLongestSubstring(string s) {
+        bool ss[128] = {false};
+        int n = s.size();
+        int ans = 0;
+        for (int i = 0, j = 0; i < n; ++i) {
+            while (ss[s[i]]) {
+                ss[s[j++]] = false;
+            }
+            ss[s[i]] = true;
+            ans = max(ans, i - j + 1);
+        }
+        return ans;
+    }
+};
+```
+
 ### **Go**
 
 ```go
@@ -146,6 +184,29 @@ func max(a, b int) int {
 }
 ```
 
+```go
+func lengthOfLongestSubstring(s string) (ans int) {
+	ss := make([]bool, 128)
+	j := 0
+	for i, c := range s {
+		for ss[c] {
+			ss[s[j]] = false
+			j++
+		}
+		ss[c] = true
+		ans = max(ans, i-j+1)
+	}
+	return
+}
+
+func max(a, b int) int {
+	if a > b {
+		return a
+	}
+	return b
+}
+```
+
 ### **JavaScript**
 
 ```js
@@ -155,7 +216,7 @@ func max(a, b int) int {
  */
 var lengthOfLongestSubstring = function (s) {
     let ans = 0;
-    let vis = new Set();
+    const vis = new Set();
     for (let i = 0, j = 0; i < s.length; ++i) {
         while (vis.has(s[i])) {
             vis.delete(s[j++]);
@@ -172,7 +233,7 @@ var lengthOfLongestSubstring = function (s) {
 ```ts
 function lengthOfLongestSubstring(s: string): number {
     let ans = 0;
-    let vis = new Set<string>();
+    const vis = new Set<string>();
     for (let i = 0, j = 0; i < s.length; ++i) {
         while (vis.has(s[i])) {
             vis.delete(s[j++]);
@@ -184,6 +245,22 @@ function lengthOfLongestSubstring(s: string): number {
 }
 ```
 
+```ts
+function lengthOfLongestSubstring(s: string): number {
+    let ans = 0;
+    const n = s.length;
+    const ss: boolean[] = new Array(128).fill(false);
+    for (let i = 0, j = 0; i < n; ++i) {
+        while (ss[s[i]]) {
+            ss[s[j++]] = false;
+        }
+        ss[s[i]] = true;
+        ans = Math.max(ans, i - j + 1);
+    }
+    return ans;
+}
+```
+
 ### **Rust**
 
 ```rust

lcof/面试题48. 最长不含重复字符的子字符串/Solution.js

@@ -4,7 +4,7 @@
  */
 var lengthOfLongestSubstring = function (s) {
     let ans = 0;
-    let vis = new Set();
+    const vis = new Set();
     for (let i = 0, j = 0; i < s.length; ++i) {
         while (vis.has(s[i])) {
             vis.delete(s[j++]);

lcof/面试题48. 最长不含重复字符的子字符串/Solution.ts

@@ -1,6 +1,6 @@
 function lengthOfLongestSubstring(s: string): number {
     let ans = 0;
-    let vis = new Set<string>();
+    const vis = new Set<string>();
     for (let i = 0, j = 0; i < s.length; ++i) {
         while (vis.has(s[i])) {
             vis.delete(s[j++]);

lcof2/剑指 Offer II 016. 不含重复字符的最长子字符串/README.md

@@ -156,16 +156,31 @@ func max(a, b int) int {
 
 ### **TypeScript**
 
+```ts
+function lengthOfLongestSubstring(s: string): number {
+    let ans = 0;
+    const vis = new Set<string>();
+    for (let i = 0, j = 0; i < s.length; ++i) {
+        while (vis.has(s[i])) {
+            vis.delete(s[j++]);
+        }
+        vis.add(s[i]);
+        ans = Math.max(ans, i - j + 1);
+    }
+    return ans;
+}
+```
+
 ```ts
 function lengthOfLongestSubstring(s: string): number {
     let ans = 0;
     const n = s.length;
     const ss: boolean[] = new Array(128).fill(false);
     for (let i = 0, j = 0; i < n; ++i) {
-        while (ss[s.charCodeAt(i)]) {
-            ss[s.charCodeAt(j++)] = false;
+        while (ss[s[i]]) {
+            ss[s[j++]] = false;
         }
-        ss[s.charCodeAt(i)] = true;
+        ss[s[i]] = true;
         ans = Math.max(ans, i - j + 1);
     }
     return ans;

lcof2/剑指 Offer II 016. 不含重复字符的最长子字符串/Solution.ts

@@ -3,10 +3,10 @@ function lengthOfLongestSubstring(s: string): number {
     const n = s.length;
     const ss: boolean[] = new Array(128).fill(false);
     for (let i = 0, j = 0; i < n; ++i) {
-        while (ss[s.charCodeAt(i)]) {
-            ss[s.charCodeAt(j++)] = false;
+        while (ss[s[i]]) {
+            ss[s[j++]] = false;
         }
-        ss[s.charCodeAt(i)] = true;
+        ss[s[i]] = true;
         ans = Math.max(ans, i - j + 1);
     }
     return ans;

solution/0000-0099/0003.Longest Substring Without Repeating Characters/README.md

@@ -111,6 +111,25 @@ class Solution {
 }
 ```
 
+```java
+class Solution {
+    public int lengthOfLongestSubstring(String s) {
+        boolean[] ss = new boolean[128];
+        int ans = 0, j = 0;
+        int n = s.length();
+        for (int i = 0; i < n; ++i) {
+            char c = s.charAt(i);
+            while (ss[c]) {
+                ss[s.charAt(j++)] = false;
+            }
+            ans = Math.max(ans, i - j + 1);
+            ss[c] = true;
+        }
+        return ans;
+    }
+}
+```
+
 ### **C++**
 
 ```cpp
@@ -129,6 +148,25 @@ public:
 };
 ```
 
+```cpp
+class Solution {
+public:
+    int lengthOfLongestSubstring(string s) {
+        bool ss[128] = {false};
+        int n = s.size();
+        int ans = 0;
+        for (int i = 0, j = 0; i < n; ++i) {
+            while (ss[s[i]]) {
+                ss[s[j++]] = false;
+            }
+            ss[s[i]] = true;
+            ans = max(ans, i - j + 1);
+        }
+        return ans;
+    }
+};
+```
+
 ### **Go**
 
 ```go
@@ -154,6 +192,29 @@ func max(a, b int) int {
 }
 ```
 
+```go
+func lengthOfLongestSubstring(s string) (ans int) {
+	ss := make([]bool, 128)
+	j := 0
+	for i, c := range s {
+		for ss[c] {
+			ss[s[j]] = false
+			j++
+		}
+		ss[c] = true
+		ans = max(ans, i-j+1)
+	}
+	return
+}
+
+func max(a, b int) int {
+	if a > b {
+		return a
+	}
+	return b
+}
+```
+
 ### **JavaScript**
 
 ```js
@@ -201,15 +262,30 @@ public class Solution {
 
 ```ts
 function lengthOfLongestSubstring(s: string): number {
-    const ss = new Set();
-    let i = 0;
     let ans = 0;
-    for (let j = 0; j < s.length; ++j) {
-        while (ss.has(s[j])) {
-            ss.delete(s[i++]);
+    const vis = new Set<string>();
+    for (let i = 0, j = 0; i < s.length; ++i) {
+        while (vis.has(s[i])) {
+            vis.delete(s[j++]);
         }
-        ss.add(s[j]);
-        ans = Math.max(ans, j - i + 1);
+        vis.add(s[i]);
+        ans = Math.max(ans, i - j + 1);
+    }
+    return ans;
+}
+```
+
+```ts
+function lengthOfLongestSubstring(s: string): number {
+    let ans = 0;
+    const n = s.length;
+    const ss: boolean[] = new Array(128).fill(false);
+    for (let i = 0, j = 0; i < n; ++i) {
+        while (ss[s[i]]) {
+            ss[s[j++]] = false;
+        }
+        ss[s[i]] = true;
+        ans = Math.max(ans, i - j + 1);
     }
     return ans;
 }