Leetcode_003_Longest_Substring_Without_Repeating_Characters
2017-01-06 07:31
423 查看
public class Solution {
public int lengthOfLongestSubstring(String s) {
int result = Integer.MIN_VALUE;
int len = s.length();
if(len == 0 || len == 1) return len;
int []dp = new int[len];
dp[0] = 1;
for(int i = 1; i<len; i++){
int index = i;
while(index-1>=0 && s.charAt(i) != s.charAt(index-1)) index--;
if(index == 0) dp[i] = dp[i-1]+1;
else dp[i] = Math.min(dp[i-1]+1, i-index+1);
if(dp[i] > result) result = dp[i];
}
return result;
}
}DP 2pointers
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- LeetCode 003 Longest Substring Without Repeating Characters
- leetcode 003 Longest Substring Without Repeating Characters
- 【LeetCode】003 Longest Substring Without Repeating Characters 最长的没有重复的子字符串
- 【LeetCode-面试算法经典-Java实现】【003-Longest Substring Without Repeating Characters（最长非重复子字符串）】
- LeetCode 003 Longest Substring Without Repeating Characters O(n)做法
- leetcode解题方案--003--LongestSubstringWithoutRepeatingCharacters
- LeetCode 003 Longest Substring Without Repeating Characters
- leetcode [003] : Longest Substring Without Repeating Characters
- LeetCode003__Longest Substring Without Repeating Characters
- Leetcode003 Longest Substring Without Repeating Characters
- [Leetcode题解]003 Longest Substring Without Repeating Characters
- LeetCode-003 Longest Substring Without Repeating Characters
- LeetCode 003 Longest Substring Without Repeating Characters
- LeetCode 003: Longest Substring Without Repeating Characters
- LeetCode 003-Longest Substring Without Repeating Characters
- [LeetCode]题解（python）：003-Longest Substring Without Repeating Characters
- LeetCode_003 Longest Substring Without Repeating Characters(greedy)
- LeetCode - Longest SubString without repeating characters_003
- [LeetCode 003] Longest Substring Without Repeating Characters
- [LeetCode]-003-Longest Substring Without Repeating Characters