3. 无重复字符的最长子串

算法原链接

https://leetcode-cn.com/problems/longest-substring-without-repeating-characters/

解法

package main
import (
    "fmt"
    "strconv"
)
func main() {
}
func lengthOfLongestSubstring(str string) int {
    m := make(map[byte]int8)
    var rp int = -1
    var max int = 0
    var l int = len(str)
    for i := 0; i < l; i++ {
        if i != 0 {
            delete(m, str[i - 1])
        }
        for rp + 1 < l && m[str[rp + 1]] == 0 {
            m[str[rp + 1]]++
            rp++
        }
        if rp - i + 1 > max {
            max = rp - i + 1
        }
    }
    return max
}