LeetCode——Longest Substring Without Repeating Characters
2015-07-13 20:11
375 查看
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.
给定一个字符串,找出最长的无反复子串。
repeating letters for "abcabcbb" is "abc", which the length is 3. For "bbbbb" the longest substring is "b", with the length of 1.
给定一个字符串,找出最长的无反复子串。
public static int lengthOfLongestSubstring(String s) { if (s == null || s.length() == 0) return 0; int maxlen = 1; boolean[] flag = new boolean[256]; int start = 0; for (int i = 0; i < s.length(); i++) { char ch = s.charAt(i); if (flag[ch]) { maxlen = Math.max(maxlen, i - start); for (int j = start; j < i; j++) { if (s.charAt(j) == ch) { start = j + 1; break; } flag[s.charAt(j)] = false; } } else flag[ch] = true; } return Math.max(maxlen, s.length() - start); }
相关文章推荐
- 3522: [Poi2014]Hotel( 树形dp )
- linux kernel 网络协议栈之xps特性详解
- Window系统装机步骤
- Fork 一个仓库并同步
- Java连接MQ的实例
- js获取项目的各个路径
- 内存泄漏检测
- Python 序列的方法
- C语言基础之--------内存地址分配
- 可以使电脑更加顺手的软件以及设置(个人习惯)
- nyoj118 修路方案(求次小生成树)
- Xshell实现Windows上传文件到Linux主机
- wince 自动启动程序设置
- C语言基础———指针,结构体指针,函数指针
- 提交修改
- TinyXML开源XML解析器-TinyXML-2
- POJ 3168 Barn Expansion (几何+排序)
- springmvc拦截器使用
- 找呀志_往来(6)_仿微通道底部导航栏
- 调度时机分析之被动调度(之系统调用返回)