[算法分析与设计] leetcode 每周一题:Longest Substring Without Repeating Characters
来源:互联网 发布:机械革命 知乎 编辑:程序博客网 时间:2024/05/21 14:56
题目链接:https://leetcode.com/problems/longest-substring-without-repeating-characters/description/
题目大意:找出string中最长不重复子串
思路:
一开始我是想着暴力解决,用start and end两个指针遍历,这样会有n2的复杂度,超时,因此查看了其他博客,比如这个http://blog.csdn.net/feliciafay/article/details/16895637才发现有O(n)的解法,主要思路是依旧是用两个指针指定子串开始和末尾,
用map<char, int>来存储扫过的char以及其索引,一旦遇到重复,停止扫描,比较长度,然后从子串里重复的元素的索引+1处开
始新一轮遍历。
代码:
class Solution {public: int lengthOfLongestSubstring(string s) { int start = 0; int end = 0; int maxLen = 0; int slen = s.length(); map<char, int> localMap; while(start < slen && end < slen) { end = start; localMap.clear(); while(end < slen && localMap.find(s[end]) == localMap.end()) { localMap[s[end]] = end; end++; } int length = end - start; maxLen = length > maxLen ? length : maxLen; start = localMap[s[end]] + 1; } return maxLen; }};
阅读全文
0 0
- [算法分析与设计] leetcode 每周一题:Longest Substring Without Repeating Characters
- 每周LeetCode算法题(一):Longest Substring Without Repeating Characters
- 算法分析与设计——LeetCode:3. Longest Substring Without Repeating Characters
- 算法分析与设计——LeetCode Problem.3 Longest Substring Without Repeating Characters
- 数据结构与算法[LeetCode]—Longest Substring Without Repeating Characters
- LeetCode算法题3:Longest Substring Without Repeating Characters
- leetcode算法题之 3. Longest Substring Without Repeating Characters
- LeetCode算法题——Longest Substring Without Repeating Characters
- 算法设计与分析(4)-- Longest Substring Without Repeating Characters(难度:Medium)
- Leetcode题目分析 3. Longest Substring Without Repeating Characters
- 3. Longest Substring Without Repeating Characters --- leetcode算法笔记
- LeetCode算法题目:Longest Substring Without Repeating Characters
- Longest Substring Without Repeating Characters(算法分析week4)
- leetCode 3. Longest Substring Without Repeating Characters 解法与思路
- LeetCode: Longest Substring Without Repeating Characters
- LeetCode Longest Substring Without Repeating Characters
- LeetCode: Longest Substring Without Repeating Characters
- [Leetcode] Longest Substring Without Repeating Characters
- 排序-插入类排序
- 11/20/2017
- 百度地图开发之一(创建百度地图)
- Shell语言
- 多线程基础01
- [算法分析与设计] leetcode 每周一题:Longest Substring Without Repeating Characters
- 【OpenCV】目标检测
- Eclipse中添加文档注释快捷键
- Java基础面试题(二)
- 在北京,年薪300000+的产品经理长啥样?
- 基础巩固--编写一个完美的equals方法
- 【C++】虚函数原理
- 2017 沈阳区域赛部分题解
- 多线程基础02