首页 > 代码库 > [LeetCode] Longest Substring Without Repeating Characters
[LeetCode] Longest Substring Without Repeating Characters
Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for "abcabcbb" is "abc", which the length is 3. For "bbbbb" the longest substring is "b", with the length of 1.
http://blog.csdn.net/pickless/article/details/9018575
#if 0class Solution {public: int lengthOfLongestSubstring(string s) { // Start typing your C/C++ solution below // DO NOT write int main() function int locs[256];//保存字符上一次出现的位置 memset(locs, -1, sizeof(locs)); int idx = -1, max = 0;//idx为当前子串的开始位置-1 for (int i = 0; i < s.size(); i++) { if (locs[s[i]] > idx)//如果当前字符出现过，那么当前子串的起始位置为这个字符上一次出现的位置+1 { idx = locs[s[i]]; } if (i - idx > max) { max = i - idx; } locs[s[i]] = i; } return max; }};#endifclass Solution { public: int lengthOfLongestSubstring(string s) { int hash[256]; // save the index of s[i] int start = -1; int len = 0; memset(hash, -1, sizeof(hash)); for(int i = 0; i< s.size(); i++/**/) { // update the start if the start is in the front of the old hash[s[i]] if(start < hash[s[i]]) start = hash[s[i]]; len = max(i - start, len); hash[s[i]] = i; } return len; } };
[LeetCode] Longest Substring Without Repeating Characters
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。