Longest Substring Without Repeating Characters
来源:互联网 发布:mac pro删除文件 编辑:程序博客网 时间:2024/06/05 03:10
原题地址:点我传送
这道题的思路还是比较简单的(但是要用到哈希容器),用一个哈希表记录在字符串中某个字符出现的最后一次的位置,并用两个值记录当前无重复字符字串的头和尾。然后从头遍历到尾的时候如果有已出现的字符,则更新当前记录的字串的首部到该字符上次出现的下一位和当前首部的较大值,另外还要更新哈希表和最长字串长度。
Java:
public class Solution { public int lengthOfLongestSubstring(String s) { if(s.length()==0)return 0; HashMap<Character, Integer> map = new HashMap<Character, Integer>(); int ans=0,start=0; for(int i=0;i<s.length();i++) { if(map.containsKey(s.charAt(i))) { start = Math.max(start,map.get(s.charAt(i))+1); } map.put(s.charAt(i),i); ans = Math.max(ans,i-start+1); } return ans; }}
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
- 高德地图开发(一)显示地图
- CPU卡程序设计实例(四)CPU卡处理流程
- Could I use NEON and VFP at the same time in my application?
- 对数组进行指定位置的翻转
- Imatest 测CCM系数的方法
- Longest Substring Without Repeating Characters
- 云中漫步,做个公众号方便生活、取悦自己
- pyqt4--QtDesigner软件使用教程
- Java WebService简单入门
- 关于Session会话
- Java Day01-1
- PCB设计3W、20H、五五规则
- kNN
- 第一节:Maven初窥