Categorygithub.com/szhou12/leetcode-goleetcode0003-Longest-Substring-Without-Repeating-Characters
package
0.0.0-20241220224003-b7cf03a90b2b
Repository: https://github.com/szhou12/leetcode-go.git
Documentation: pkg.go.dev
Overview
Dependencies
0
Dependents
0

# README

3. Longest Substring Without Repeating Characters

Solution idea

Sliding Window

  • 吃了吐
    1. 什么时候应该扩大窗口？(吃)
    2. 什么时候应该缩小窗口？(吐)
    3. 什么时候应该更新答案？

Time complexity = $O(n)$

Resource

滑动窗口算法