Leetcode-- Longest Substring Without Repeating Characters
2017-09-02 16:24
381 查看
求最长不重复子串长度,复杂度为O(n²),有待优化
class Solution { public: int lengthOfLongestSubstring(string s) { int maxlen=0,len=s.size(); if(len==0) { cout<<"nothing"<<endl; } else if(len==1) { maxlen=1; } else{ int dp[len+1]; int i,j; int last_start=0; dp[0]=1; for(i=1;i<len;++i) { for(j=i-1;j>=last_start;--j) { if(s[j]==s[i]) { dp[i]=i-j; last_start=j+1; break; } else if(j==last_start) { dp[i]=dp[i-1]+1; } } if(dp[i]>maxlen) { maxlen=dp[i]; } }} return maxlen; } };
相关文章推荐
- LeetCode3:Longest Substring Without Repeating Characters
- LeetCode Longest Substring Without Repeating Characters
- leetcode-----------Longest Substring Without Repeating Characters
- [LeetCode] Longest Substring Without Repeating Characters
- Leetcode: Longest Substring Without Repeating Characters
- LeetCode——Longest Substring Without Repeating Characters
- LeetCode-Longest Substring Without Repeating Characters
- LeetCode[3] Longest Substring Without Repeating Characters
- leetcode之Longest Substring Without Repeating Characters
- leetcode 3 golang实现 Longest Substring Without Repeating Characters
- Leetcode_3_Longest Substring Without Repeating Characters
- Leetcode Probelm.3 Longest Substring Without Repeating Characters
- [LeetCode]Longest Substring Without Repeating Characters@python
- LeetCode - Longest Substring Without Repeating Characters
- LeetCode 003 Longest Substring Without Repeating Characters
- [leetcode 3] Longest Substring Without Repeating Characters
- 《leetCode》:Longest Substring Without Repeating Characters
- LeetCode Longest Substring Without Repeating Characters
- LeetCode 003 Longest Substring Without Repeating Characters
- leetcode 3:Longest Substring Without Repeating Characters