leecode algo3: Longest Substring Without Repeating Characters (Java)
来源:互联网 发布:vb教程 编辑:程序博客网 时间:2024/04/28 09:29
leetcode algo3:Longest Substring Without Repeating Characters
题目:Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for "abcabcbb" is "abc", which the length is 3. For "bbbbb" the longest substring is "b", with the length of 1.
实现思想:见我的另一篇博客: http://blog.csdn.net/liyuming0000/article/details/46925509
具体实现如下(leetcode 提交通过, Run Time:5ms):
package algo3;public class Solution {public static void main(String[] args) {Solution s = new Solution();String str = "jhhjnsfudufbdfyscfbsdjjS";System.out.println(s.lengthOfLongestSubstring(str));}public int lengthOfLongestSubstring(String s) {/*if(s == null)return 0;char [] sCharArr = s.toCharArray();HashMap<Character, Integer> charsIndex = new HashMap<Character, Integer>();int startIndex = -1, maxLen = 0;for(int index = 0; index < sCharArr.length; index++) {if(charsIndex.containsKey(sCharArr[index])) {int oriIndex = charsIndex.get(sCharArr[index]);if(oriIndex > startIndex){startIndex = oriIndex;}}if(index - startIndex > maxLen) {maxLen = index - startIndex;}charsIndex.put(sCharArr[index], index);}return maxLen; */if(s == null)return 0;char [] sCharArr = s.toCharArray();int [] charsIndex = new int[256];for(int index = 0; index < 256; index++)charsIndex[index] = -1;int startIndex = -1, maxLen = 0;for(int index = 0; index < sCharArr.length; index++) {if(charsIndex[sCharArr[index]] > startIndex)startIndex = charsIndex[sCharArr[index]];if(index - startIndex > maxLen) {maxLen = index - startIndex;}charsIndex[sCharArr[index]] = index;}return maxLen;}}
0 0
- leecode algo3: Longest Substring Without Repeating Characters (Java)
- LeeCode--Longest Substring Without Repeating Characters
- LeeCode Longest Substring Without Repeating Characters
- Leecode:Longest Substring Without Repeating Characters
- [Leetcode] Longest Substring Without Repeating Characters (Java)
- Longest Substring Without Repeating Characters (Java)
- Longest Substring Without Repeating Characters -- Leetcode Java
- [Leetcode]Longest Substring Without Repeating Characters java
- [LeetCode][Java] Longest Substring Without Repeating Characters
- LeetCode java Longest Substring Without Repeating Characters
- [letecode java]Longest Substring Without Repeating Characters
- LeetCode : Longest Substring Without Repeating Characters [java]
- Java-LeetCode-Longest Substring Without Repeating Characters
- Java Leetcode Longest Substring Without Repeating Characters
- 【LeetCode】 Longest Substring Without Repeating Characters(Java)
- Longest Substring Without Repeating Characters leetcode java
- Longest Substring Without Repeating Characters
- Longest Substring Without Repeating Characters
- 【PAT】1100. Mars Numbers (20)
- 计数排序
- C#检测网络状态
- DFS POJ 1011 Sticks
- Linux内核工程导论——网络:IP:隧道
- leecode algo3: Longest Substring Without Repeating Characters (Java)
- XeLeTeX字体警告"EU1/SimSun(0)/m/it' undefined的原因
- Theano入门——MNIST数据库
- superoj732 砝码称重
- Ubuntu无法重启apache2
- 对象的状态特性
- os如何处理键盘的所有按键,显示or不显示,显示是如何显示
- Linux内核工程导论——存储:分布式存储
- 黑马程序员——IO(1)