3. Longest Substring Without Repeating Characters
来源：互联网 发布：清除mac上的个人信息 编辑：程序博客网 时间：2024/06/07 02:13
思路：是要找到无重复字母的最大子串 循环遍历时间复杂度太高 可以定义一个辅助数组;
public int lengthOfLongestSubstring(String s) { int res = 0;//结果 int left = 0;//维持一个left指针 指向没有重复字母的子串的开始 int prev[] = new int[300]; //辅助数组 prev[i]代表字母i出现的位置 for (int i = 0; i < 300; ++i) prev[i] = -1; for (int i = 0; i < s.length(); ++i) { if (prev[s.charAt(i)] >= left) left = prev[s.charAt(i)] + 1; prev[s.charAt(i)] = i; if (res < i - left + 1) res = i - left + 1; } return res; } 0 0
- [LeetCode]3.Longest Substring Without Repeating Characters
- LeetCode 3.Longest Substring Without Repeating Characters
- LeetCode --- 3. Longest Substring Without Repeating Characters
- 3.Longest Substring Without Repeating Characters
- [Leetcode] 3. Longest Substring Without Repeating Characters
- 3.Longest Substring Without Repeating Characters
- 3. Longest Substring Without Repeating Characters
- 3.Longest Substring Without Repeating Characters
- 3.Longest Substring Without Repeating Characters
- 3.Longest Substring Without Repeating Characters
- 3. Longest Substring Without Repeating Characters
- [leetcode] 3.Longest Substring Without Repeating Characters
- 3.Longest Substring Without Repeating Characters
- [leetcode] 3. Longest Substring Without Repeating Characters
- 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
- Linux下编译boost库生成 libboost_thread-mt.a 的方法
- Slice:Drop——基于Web的医学影像浏览工具
- 利用FFmpeg将mkv视频转换为H.264
- PDO预处理案例
- 110. Balanced Binary Tree 平衡二叉树（重点！！）
- 3. Longest Substring Without Repeating Characters
- JQ笔记本之attr属性操作（赋值与读取）
- 8、Servlet技术
- PayPal开发 -- REDICT CREDIT CARD PAYMNETS AND PCI compliance
- linux patch
- 文章标题
- JQ笔记本之filter,not条件(过滤)选择操作
- WebView
- 第一次sdut上打字！！！
