Longest Substring Without Repeating Characters
来源:互联网 发布:清朝皇帝 知乎 编辑:程序博客网 时间:2024/04/28 12:28
方法一: 用一个int a[256] 标记每一个字符最后一次出现的位置,将数组a的各个变量初始化位-1。
代码如下:
class Solution {public: int lengthOfLongestSubstring(string s) { int a[256]; memset(a, -1, sizeof(a)); int maxlen = 0; int start = 0; int i; for(i=0; i<s.size(); i++) { if(a[s[i]] == -1) { a[s[i]] = i; } else { if(i-start > maxlen) maxlen = i-start; start = a[s[i]]+1>start?(a[s[i]]+1):start; a[s[i]] = i; } } if(i-start > maxlen) maxlen = i-start; return maxlen; }};
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
- 小白鼠与毒药解题过程分析
- struct的内存对齐(转)
- 说明ThreadLocal的用法和运用场景
- LinuxCast学习笔记三十一:FTP
- hdu 1253 胜利大逃亡 bfs
- Longest Substring Without Repeating Characters
- MySQL性能优化的最佳20+条经验
- JS判断字符串长度(英文占1个字符,中文汉字占2个字符)
- 降魔篇之springmvc权限控制
- 过河卒
- UINavigationController详解(三)UIToolBar
- 代码整洁之所以重要的七个理由
- codeforces 402B - Trees in a Row
- 也说 Jquery+ASP.NET 实现开心网上传头像剪裁功能