3. Longest Substring Without Rep

作者: AnakinSun | 来源:发表于2019-03-22 02:31 被阅读0次

3. Longest Substring Without Rep
3. Longest Substring Without Rep
3. Longest Substring Without Rep
3. Longest Substring Without Rep
3. Longest Substring Without Rep
3. Longest Substring Without Rep
3. Longest Substring Without Rep
3. Longest Substring Without Rep
3. Longest Substring Without Rep
3. Longest Substring Without Rep

滑动窗口，如果在hash表里找到了当前的字符，重新设置窗口的起点位置

func lengthOfLongestSubstring(s string) int {
    m := make(map[rune]int)
    start, max := -1, 0

    for k, v := range s {
        if last, ok := m[v]; ok && last > start { //如果发现重复字符
            start = last
        }
        m[v] = k
        if k-start > max { //保存最大值
            max = k - start
        }
    }
    return max
}

网友评论

leetcode

本文标题：3. Longest Substring Without Rep

本文链接：https://www.haomeiwen.com/subject/leskvqtx.html

延伸阅读

深度阅读

您也可以注册成为美文阅读网的作者，发表您的原创作品、分享您的心情！

3. Longest Substring Without Rep

相关文章

3. Longest Substring Without Rep

3. Longest Substring Without Rep

3. Longest Substring Without Rep

3. Longest Substring Without Rep

3. Longest Substring Without Rep

3. Longest Substring Without Rep

3. Longest Substring Without Rep

3. Longest Substring Without Rep

3. Longest Substring Without Rep

3. Longest Substring Without Rep

网友评论

延伸阅读

深度阅读

栏目导航

热点阅读

leetcode