Leetcode-- Longest Substring Without Repeating Characters
2017-09-02 16:24
288 查看
求最长不重复子串长度，复杂度为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;
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- LeetCode No.3 Longest Substring Without Repeating Characters
- Leetcode题解：4. Longest Substring Without Repeating Characters
- LeetCode 003 Longest Substring Without Repeating Characters
- LeetCode 3 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-3 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 Exercise 3: Longest Substring Without Repeating Characters
- LeetCode 3 - Longest Substring Without Repeating Characters
- 3. [leetcode] Longest Substring Without Repeating Characters
- java_LeetCode_3--Longest Substring Without Repeating Characters
- LeetCode : Given a string, find the length of the longest serial substring without repeating characters.
- [Leetcode]Longest Substring Without Repeating Characters
- LeetCode-3:Longest Substring Without Repeating Characters
- LeetCode-Longest Substring Without Repeating Characters
- LeetCode力扣之Longest Substring Without Repeating Characters