LeetCode 3 最大不重复子串
2015-09-10 16:58
309 查看
找出最大不重复子串
关键在于利用哈希表的查找优势,设置一个记录不重复字串的开始位置。需要线性时间
public class Solution {
public int LengthOfLongestSubstring(string s)
{
Dictionary<char,int> dict=new Dictionary<char,int>();
int a=0,cur=0,max=0;
for(int i=0;i<s.Length;i++)
{
if(!dict.Keys.Contains(s[i]))
{
dict.Add(s[i],i);
cur++;
max=max>cur?max:cur;
}
else
{
a=a<dict[s[i]]?dict[s[i]]:a;
cur=i-a;
max=max>cur?max:cur;
dict[s[i]]=i;
}
}
return max;
}
}
关键在于利用哈希表的查找优势,设置一个记录不重复字串的开始位置。需要线性时间
public class Solution {
public int LengthOfLongestSubstring(string s)
{
Dictionary<char,int> dict=new Dictionary<char,int>();
int a=0,cur=0,max=0;
for(int i=0;i<s.Length;i++)
{
if(!dict.Keys.Contains(s[i]))
{
dict.Add(s[i],i);
cur++;
max=max>cur?max:cur;
}
else
{
a=a<dict[s[i]]?dict[s[i]]:a;
cur=i-a;
max=max>cur?max:cur;
dict[s[i]]=i;
}
}
return max;
}
}
相关文章推荐
- leetcode 179 Largest Number
- leetcode 24 Swap Nodes in Pairs
- leetcode 2 Add Two Numbers 方法1
- leetcode 2 Add Two Numbers 方法2
- [LeetCode]47 Permutations II
- [LeetCode]65 Valid Number
- [LeetCode]123 Best Time to Buy and Sell Stock III
- [LeetCode] String Reorder Distance Apart
- [LeetCode] Sliding Window Maximum
- [LeetCode] Find the k-th Smallest Element in the Union of Two Sorted Arrays
- [LeetCode] Determine If Two Rectangles Overlap
- [LeetCode] A Distance Maximizing Problem
- leetcode_linearList
- leetcode_linearList02
- LeetCode[Day 1] Two Sum 题解
- LeetCode[Day 2] Median of Two Sorted Arrays 题解
- LeetCode[Day 3] Longest Substring Without... 题解
- LeetCode [Day 4] Add Two Numbers 题解
- LeetCode [Day 5] Longest Palindromic Substring 题解
- LeetCode [Day 6] ZigZag Conversion 题解