Longest Substring Without Repeating Characters
来源:互联网 发布:怎么申请淘宝旗舰店 编辑:程序博客网 时间:2024/06/06 12:22
Given a string, find the length of the longest substring without repeating characters.
Examples:
Given “abcabcbb”, the answer is “abc”, which the length is 3.
Given “bbbbb”, the answer is “b”, with the length of 1.
Given “pwwkew”, the answer is “wke”, with the length of 3. Note that the answer must be a substring, “pwke” is a subsequence and not a substring.
就是找到一个字符串中不重复的最长子串。
基本思路是维护一个窗口,每次关注窗口中的字符串,在每次判断中,左窗口和右窗口选择其一向前移动。同样是维护一个HashSet, 正常情况下移动右窗口,如果没有出现重复则继续移动右窗口,如果发现重复字符,则说明当前窗口中的串已经不满足要求,继续移动右窗口不可能得到更好的结果,此时移动左窗口,直到不再有重复字符为止,中间跳过的这些串中不会有更好的结果,因为他们不是重复就是更短。因为左窗口和右窗口都只向前,所以两个窗口都对每个元素访问不超过一遍,因此时间复杂度为O(2*n)=O(n),是线性算法。空间复杂度为HashSet的size,也是O(n). 代码如下:
public int lengthOfLongestSubstring(String s) { int max=0,right=0,left=0; int len=s.length(); HashSet<Character> set = new HashSet<Character>(); while(right<len){ if(set.contains(s.charAt(right))){ if(max<right-left){//判断当前子串长度是否比以前记录的大 max=right-left; } //最开始写的是while(left<right)但是超时了! while(s.charAt(left)!=s.charAt(right)){ set.remove(s.charAt(left)); left++; } left++;//将左窗口移动到删除重复元素的后一个 }else{ set.add(s.charAt(right)); } right++; } max=Math.max(max, right-left); return max; }
昨天一直没看明白,今早就看明白了。。看来不要放弃是对的。。
阅读全文
0 0
- Longest Substring Without Repeating Characters
- Longest Substring Without Repeating Characters
- Longest Substring Without Repeating Characters
- Longest Substring Without Repeating Characters
- Longest Substring Without Repeating Characters
- Longest Substring Without Repeating Characters
- Longest Substring Without Repeating Characters
- Longest Substring Without Repeating Characters
- Longest Substring Without Repeating Characters
- Longest Substring Without Repeating Characters
- Longest Substring Without Repeating Characters
- Longest Substring Without Repeating Characters
- Longest Substring Without Repeating Characters
- Longest Substring Without Repeating Characters
- Longest Substring Without Repeating Characters
- Longest Substring Without Repeating Characters
- Longest Substring Without Repeating Characters
- Longest Substring Without Repeating Characters
- IPV6、IPV4
- BZOJ3132 上帝造题的七分钟 【二维树状数组】
- 会议记录管理系统(6)
- Poj-1042-Gone Fishing-枚举+贪心
- 雇员管理系统-SSH版(八)
- Longest Substring Without Repeating Characters
- centos配置hostname
- 解决linux下sudo更改文件权限报错xxxis not in the sudoers file. This incident will be reported.
- 蓝桥杯 算法训练 区间k大数查询
- [Leetcode] 561. Array Partition I 解题报告
- rhinoceros Mac(犀牛mac) v5.4中文破解版
- 闭包与匿名函数
- 关于操作系统
- POJ