longest substring without repeating character leetcode c++
来源：互联网 发布：学生打人知乎 编辑：程序博客网 时间：2024/05/16 02:42
this problem broaden its test set,so that we should use sign[xxxx]-'a' two record;
and when we calculate the length, we should test j-i+1;
class Solution {public: int lengthOfLongestSubstring(string s) { int sign[300]={0}; int i = 0; int j = 0; int max = 0; for(i = 0,j = 0;j<s.length();j++) { while(sign[s[j]-' '] == 1) { sign[s[i]-' '] = 0; i++; } sign[s[j]-' '] = 1; if(j-i +1> max) max = j-i+1; } return max; }}; 0 0
- longest substring without repeating character leetcode c++
- LeetCode: Longest Substring Without Repeating Character
- leetcode Longest Substring Without Repeating Character(Java)
- Longest Substring Without Repeating Character
- 《leetcode》longest-substring-without-repeating
- 3 Longest Substring Without Repeating Character
- 3 Longest substring without repeating character
- LEETCODE3. Longest Substring Without Repeating Character
- [LeetCode]3 Longest Substring Without Repeating Characters (C++，Python实现)
- LeetCode 3. Longest Substring Without Repeating Characters (C++/python)
- [C++]LeetCode: 105 Longest Substring Without Repeating Characters
- C实现 LeetCode->Longest Substring Without Repeating Characters
- [c++] LeetCode longest substring without repeating characters问题
- [LeetCode#3][C]Longest Substring Without Repeating Characters
- 【C语言】LeetCode 3. Longest Substring Without Repeating Characters
- LeetCode 3. Longest Substring Without Repeating Characters（C++）
- 【C++】【LeetCode】3. Longest Substring Without Repeating Characters
- LeetCode 3.Longest Substring Without Repeating Characters c语言版
- serverSocket与socket之间的通信
- 快速排序
- 关于Unity屏幕适配的一些事
- CentOS 网络设置修改 指定IP地址 DNS 网关（实测 笔记）
- java.lang.ClassNotFoundException: javax.el.FunctionMapper
- longest substring without repeating character leetcode c++
- 高低温交变试验箱试验箱使用注意事项与保养方法
- CaseSensitive区分大小写
- C#打印出国际象棋的棋盘
- 项目1-2 输出成倍的数组中的项
- 使用tcpdump抓Android网络包
- MySQL索引原理及慢查询优化
- Windows7 动态端口，端口重用，动态端口取值范围 (适用于win8和vista)
- Action Bar添加Style
