leetcode-ts/leetcode/0003.longest-substring-without-repeating-characters/index.ts at master · guocaoyi/leetcode-ts · GitHub

Name: leetcode-ts/leetcode/0003.longest-substring-without-repeating-characters/index.ts at master · guocaoyi/leetcode-ts · GitHub
Rating: 4.4 (8492 reviews)
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
/**
 * # 3. Longest Substring Without Repeating Characters
 *
 * Given a string, find the length of the **longest substring** without repeating characters.
 *
 * ## Example
 *
 * ```bash
 * Input: "abcabcbb"
 * Output: 3
 * Explanation: The answer is "abc", with the length of 3.
 * ```
 *
 * ```bash
 * Input: "bbbbb"
 * Output: 1
 * Explanation: The answer is "b", with the length of 1.
 * ```
 *
 * ```bash
 * Input: "pwwkew"
 * Output: 3
 * Explanation: The answer is "wke", with the length of 3.
 * Note that the answer must be a substring, "pwke" is a subsequence and not a substring.
 * ```
 */
exporttypeSolution=(s: string)=>number;

/**
 * 遍历
 * @date 2020.06.28 12:47
 * @time
 * @space
 * @runtime
 * @memory
 * @runtime_cn 100 ms, faster than 84.62%
 * @memory_cn 42.6MB, less than 100.00%
 */
exportconstlengthOfLongestSubstring=(s: string): number=>{
letmaxSub="";
letcurrentSub="";

constarr: string[]=s.split("");
arr.forEach((s: string)=>{
if(currentSub.includes(s)){
// 存在
if(currentSub.length>=maxSub.length){
maxSub=currentSub;
}
const[lStr,rStr]=currentSub.split(s);
currentSub=rStr||"";
currentSub+=s;
}else{
// 不存在
currentSub+=s;
if(currentSub.length>=maxSub.length){
maxSub=currentSub;
}
}
});
returnmaxSub.length;
};