leetcode 3. Longest Substring Without Repeating Characters

记得这要+1，j = std::max(j,container[s[i]]+1);

class Solution {
public:int lengthOfLongestSubstring(string s) {int length = s.size();if(length <= 0)return 0;unordered_map<char,int> container;int max_num = 0;for(int i = 0,j = 0;i < length;i++){if(container.find(s[i]) != container.end())j = std::max(j,container[s[i]]+1);container[s[i]] = i;max_num = std::max(max_num,i-j+1);}return max_num;}
};

https://www.cnblogs.com/StrayWolf/p/6701197.html?utm_source=itdadao&utm_medium=referral

unordered_map和map类似，都是存储的key-value的值，可以通过key快速索引到value。不同的是unordered_map不会根据key的大小进行排序，存储时是根据key的hash值判断元素是否相同，即unordered_map内部元素是无序的。unordered_map的key需要定义hash_value函数并且重载operator==。

leetcode 3. Longest Substring Without Repeating Characters相关推荐

【贪心】LeetCode 3. Longest Substring Without Repeating Characters
LeetCode 3. Longest Substring Without Repeating Characters Solution1:我的答案该方法中哈希表记录的是字符出现的次数.标准的贪心算法 ...
[LeetCode]3.Longest Substring Without Repeating Characters
[题目] Given a string, find the length of the longest substring without repeating characters. For exam ...
LeetCode:3. Longest Substring Without Repeating Characters
https://leetcode.com/problems/longest-substring-without-repeating-characters/description/ 内容描述: Give ...
[LeetCode]--3. Longest Substring Without Repeating Characters
Given a string, find the length of the longest substring without repeating characters. Examples: Giv ...
leetcode 3. Longest Substring Without Repeating Characters 最长非重复子串的长度滑动窗口法
题目链接根据我们之前介绍的滑动窗口法的解法: 滑动窗口法详解 leetcode 438. Find All Anagrams in a String 滑动窗口法这题,我们不难解决,使用之前的模板. ...
python刷leetcode_零基础python刷leetcode -- 3. Longest Substring Without Repeating Characters
算法很重要,但是每天也需要学学python,于是就想用python刷leetcode 的算法题,和我一起开始零基础python刷leetcode之旅吧.如有不对的地方,希望指正,万分感谢~~ 题目最 ...
leetcode 3. Longest Substring Without Repeating Characters | 3. 无重复字符的最长子串（双指针+滑窗）
题目 https://leetcode.com/problems/longest-substring-without-repeating-characters/ 题解双指针+滑窗,维护一个 set, ...
LeetCode 3 Longest Substring Without Repeating Characters 区间,想法难度:1
https://leetcode.com/problems/longest-substring-without-repeating-characters/ 思路:从某点结束所能取到的最早开头是到目前出 ...
[LeetCode] 3. Longest Substring Without Repeating Characters 题解
问题描述输入一个字符串,找到其中最长的不重复子串例1: 输入:"abcabcbb" 输出:3 解释:最长非重复子串为"abc" 复制代码例2: 输入:&q ...

leetcode 3. Longest Substring Without Repeating Characters

leetcode 3. Longest Substring Without Repeating Characters相关推荐

最新文章

热门文章