150強訪談簡單

沒有重複字元的最長子串

“無重複字元的最長子字串”問題的詳細指南和 Python 實作。

問題陳述

簡單

給定一個字串 s,找出不重複字元的最長子字串的長度。

寫一個函數 lengthOfLongestSubstring(s: str) -> int

約束條件
  • 0 <= len(s) <= 5 * 10^4
  • s consists of English letters, digits, symbols, and spaces

範例

Example 1
Input
s = "abcabcbb"
Output
3
Explanation

The answer is "abc", with a length of 3.

Example 2
Input
s = "bbbbb"
Output
1
Explanation

The answer is "b", with a length of 1.

Example 3
Input
s = "pwwkew"
Output
3
Explanation

The answer is "wke", with a length of 3. Note that "pwke" is a subsequence, not a substring.

Need a Hint?
考慮使用滑動視窗特定的資料結構,例如集合或堆。
Edge Cases to Watch
  • 空輸入結構
  • 單元素輸入
  • 大數值範圍

準備好解決了嗎?

Open the problem in PyRun's browser-based Python editor. Your code runs fully offline — no server required.

在編輯器中開啟
Found this breakdown helpful?

PyRun is built and maintained by an independent solo developer. If this helped your interview prep, consider buying a coffee!

Buy me a coffee

推薦的 Python 資源

透過相關的互動式教學、備忘單和程式碼比較來擴展您的知識。