原題鏈接3. Longest Substring Without Repeating Characters
Given a string, find the length of the longest substring without repeating characters.
Example 1:
Input: "abcabcbb"
Output: 3
Explanation: The answer is "abc", with the length of 3.
Example 2:
Input: "bbbbb"
Output: 1
Explanation: The answer is "b", with the length of 1.
Example 3:
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.
解題思路：為每一個(gè)字符開辟一個(gè)hashtable+滑動(dòng)窗口進(jìn)行求解巨朦，這樣更新不重復(fù)子串的長度羡榴，得到最大值
func lengthOfLongestSubstring(s string) int {
var posi [256]int
for i,_ := range posi {
posi[i] = -1
}
curr_len, max_len, start := 0, 0, 0
for i, v := range s {
val := int(v)
if posi[val] == -1 {
curr_len += 1
} else {
if start < posi[val] {
start = posi[val]
}
curr_len = i - start
}
posi[val] = i
if curr_len > max_len {
max_len = curr_len
}
}
return max_len
}
