[Leetcode] 3.Longest Substring Without Repeating Characters（unordered_map）
通過把未訪問的結點放到unordered_map中來判斷是否重複，代碼如下： 1 class Solution {
2 public:
3 int lengthOfLongestSubstring(string s) {
4 if(s == "")
5 return 0;
6 unordered_map<char,int>
相關文章
- 1. Leetcode 3. Longest Substring Without Repeating Characters
- 2. 【LeetCode】3. Longest Substring Without Repeating Characters
- 3. LeetCode - 3. Longest Substring Without Repeating Characters
- 4. LeetCode-3:Longest Substring Without Repeating Characters
- 5. [leetcode]3-Longest Substring Without Repeating Characters
- 6. leetCode 3 Longest Substring Without Repeating Characters
- 7. leetcode 3. Longest Substring Without Repeating Characters
- 8. leetcode 3 Longest Substring Without Repeating Characters
- 9. LeetCode 3 Longest Substring Without Repeating Characters
- 10. 【Leetcode】3. Longest Substring Without Repeating Characters
- 更多相關文章...
- • Swift 數組 - Swift 教程
- • PHP rtrim() 函數 - PHP參考手冊
- • 算法總結-滑動窗口
- • 爲了進字節跳動，我精選了29道Java經典算法題，帶詳細講解
相關標籤/搜索
每日一句
-
每一个你不满意的现在，都有一个你没有努力的曾经。
歡迎關注本站公眾號,獲取更多信息
相關文章
- 1. Leetcode 3. Longest Substring Without Repeating Characters
- 2. 【LeetCode】3. Longest Substring Without Repeating Characters
- 3. LeetCode - 3. Longest Substring Without Repeating Characters
- 4. LeetCode-3:Longest Substring Without Repeating Characters
- 5. [leetcode]3-Longest Substring Without Repeating Characters
- 6. leetCode 3 Longest Substring Without Repeating Characters
- 7. leetcode 3. Longest Substring Without Repeating Characters
- 8. leetcode 3 Longest Substring Without Repeating Characters
- 9. LeetCode 3 Longest Substring Without Repeating Characters
- 10. 【Leetcode】3. Longest Substring Without Repeating Characters