算法分析与设计——LeetCode Problem.3 Longest Substring Without Repeating Characters
来源:互联网 发布:计算机视觉基本算法 编辑:程序博客网 时间:2024/06/14 00:41
题目链接
问题描述
Given a string, find the length of the longest substring without repeating characters.
Examples:
Given "abcabcbb"
, the answer is "abc"
, which the length is 3.
Given "bbbbb"
, the answer is "b"
, with the length of 1.
Given "pwwkew"
, the answer is "wke"
, with the length of 3. Note that the answer must be a substring, "pwke"
is a subsequence and not a substring.
比较容易想到的办法是把每个字符遍历一遍,到达一个字符时就向前回溯,添加一个变量repeat记录回溯时遇到相同字符的位置,在下一个字符的回溯时如果也遇到了
相同的字符,则将其位置与repeat对比,若其位置靠后则令其为repeat,如此则可以避免在回溯时回溯的字串中包含相同字符的情况
class Solution {public: int lengthOfLongestSubstring(string s) { int totalLength = s.size(); if (totalLength == 0) {return 0;}if (totalLength == 1) {return 1;}int p = 0;int backtrack = 0;int maxLength = 0;int subLength = 0;int repeat = -1;for (p = 0; p < totalLength; p++) {for (backtrack = p - 1; backtrack >= 0; backtrack--) {if (s[backtrack] == s[p]) {if (repeat < backtrack) {repeat = backtrack;}break;}}subLength = p - repeat;if (maxLength < subLength) {maxLength = subLength;}}if (maxLength == 0) {return totalLength;}if (maxLength < subLength) {maxLength = subLength;}return maxLength;}};
阅读全文
0 0
- 算法分析与设计——LeetCode Problem.3 Longest Substring Without Repeating Characters
- 算法分析与设计——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题解——3Longest Substring Without Repeating Characters
- #3 LeetCode——Longest Substring Without Repeating Characters
- leetcode——3 Longest Substring Without Repeating Characters
- leetcode problem solve 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 3LONGEST 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
- 社团划分结果评估指标:Q、ARI、NMI
- 算法笔记 //03_众数问题
- PTA一元多项式的乘法与加法运算
- 01背包代码实现
- 拓展欧几里得(转载)
- 算法分析与设计——LeetCode Problem.3 Longest Substring Without Repeating Characters
- lr录制乱码或回放过程出错解决方法
- 【线段树】洛谷3582KIN
- 【kmp算法-子串暴力匹配+字符串地址传入】Blue Jeans POJ
- Golang regexp包中的函数和方法
- 数据库事务不同隔离级别的原理
- Hibernate中get和load方法的区别
- 然之OA添加应用
- python计算相关系数