leetcode Algorithms 3. Longest Substring Without Repeating Characters
来源：互联网 发布：pc淘宝首页尺寸大小 编辑：程序博客网 时间：2024/06/05 14:44
题意：最长连续子串，并且字串中没有重复的字符
思路：吊吊的O(n)算法--尺取法；
class Solution {public: int flag[300]; int lengthOfLongestSubstring(string s) { int x=s.size(); int st=0,en=0; memset(flag,0,sizeof(flag)); int ans=0; while(st<x) { while(en<x) { if(flag[s[en]])break; flag[s[en++]]++; } flag[s[st]]--; ans=max(ans,en-st); //cout<<en<<" "<<st<<" "<<x<<endl; st++; } return ans; }};阅读全文
0 0
- LeetCode Algorithms 3. Longest Substring Without Repeating Characters 题解
- LeetCode Algorithms 3. Longest Substring Without Repeating Characters
- leetcode Algorithms 3. Longest Substring Without Repeating Characters
- [LeetCode] Algorithms-3.Longest Substring Without Repeating Characters
- [LeetCode-Algorithms-3] "Longest Substring Without Repeating Characters" (2017.9.8)
- [LeetCode]3.Longest Substring Without Repeating Characters
- LeetCode 3.Longest Substring Without Repeating Characters
- LeetCode --- 3. Longest Substring Without Repeating Characters
- [Leetcode] 3. Longest Substring Without Repeating Characters
- [leetcode] 3.Longest Substring Without Repeating Characters
- [leetcode] 3. Longest Substring Without Repeating Characters
- [Leetcode]3. Longest Substring Without Repeating Characters
- leetcode 3. Longest Substring Without Repeating Characters
- 【Leetcode】3. Longest Substring Without Repeating Characters
- leetcode 3. Longest Substring Without Repeating Characters
- LeetCode-3.Longest Substring Without Repeating Characters
- LeetCode 3.Longest Substring Without Repeating Characters
- LeetCode - 3.Longest Substring Without Repeating Characters
- 新华社客户端文章：区块链金融：新蓝海还是新挑战
- 机器码农：深度学习自动编程
- Bootstrap学习之表格表单
- 录制、播放语音时，后台音频仍旧播放中
- 一个实战系统的权限架构思维推导过程
- leetcode Algorithms 3. Longest Substring Without Repeating Characters
- socket 接收图片数据
- LeetCode@Array_268_Missing_Number
- Alert ActionSheet 优雅的可自定义
- 论文实践讨论
- 欢迎更多的需要毕设和接毕设的加入！ Android/Java毕业设计——唯一QQ群：639813324
- 线程池的原理及实现
- 解决已封装好类，调试的提示不是类或命名空间
- 齐次微分方程
