Longest Substring Without Repeating Characters
来源:互联网 发布:法院网络司法拍卖 编辑:程序博客网 时间:2024/05/17 23:12
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.
class Solution {public: int lengthOfLongestSubstring(string s){if (s.empty()) return 0;int flag[256] = {0};for (int i = 0 ; i< 256; i++)flag[i] = -1;int longest = 0;int start = 0; for (int i = 0; i < s.size(); i++){if (flag[s[i]] == -1){longest = max(longest, i - start + 1);flag[s[i]] = i;}else{for (int j = start; j < flag[s[i]]; j++)flag[s[j]] = -1;start = flag[s[i]] + 1;flag[s[i]] = i;}}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
- 关于c#中networkstream.read 方法的问题
- 虚函数,静态与动态绑定
- c语言深度学习
- javaIO流-1
- C++学习及总结
- Longest Substring Without Repeating Characters
- 网页前端开发:配色学的4张宝图
- The STL Vector Class 学习笔记
- 项目三(选做)
- 项目四。
- Add Two Numbers
- LA 4728 Squares 旋转卡壳
- mac 隐藏文件快捷键创建过程(图文并茂)
- DirectX与VS2010的配置