Longest Substring Without Repeating Characters
来源:互联网 发布:ip代理软件 局域网 编辑:程序博客网 时间:2024/05/21 06:26
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.
public class Solution { public int lengthOfLongestSubstring(String s) {if (s == null || s.isEmpty()) {return 0;}int pre = 1; int length = s.length();int longest = 0;if(length == 1) return 1; for (int i = 1; i < length; i++) {char temp = s.charAt(i);int j = i - 1;int count = 1;while (j >= 0 && temp != s.charAt(j)) {j--;count++;} if(count >= pre+1) count = pre+1; if(count > longest) longest = count; pre = count; }return longest; }}
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
- UVa 10387 - Billiard
- 学好英语对IT软件工程师的影响
- 一个正则匹配的巧妙用法
- POJ 1639 Picnic Planning(K度限生成树+map建图)
- 聊聊并发(三)——JAVA线程池的分析和使用
- Longest Substring Without Repeating Characters
- hibernate 注解 多对多配置
- 基于邻接表的图的深度和广度优先搜索遍历
- 高效使用eclipse
- SVN入门和配置使用
- android :点击某个按钮弹出在原有布局中没有(或者存在)内容 :以删除原有布局内容为例
- poj1080(LCS变形)
- 使用SVN管理Android工程
- ThreadLocal的使用方法