Longest Substring Without Repeating Characters
来源:互联网 发布:linux 永久关闭 swap 编辑:程序博客网 时间:2024/06/10 07:09
题意:给定一个字符串,找出不含相同字母的连续子串
思路:复杂度o(n)
用一个数组used[500]记录每个字符出现的位置,用tempRes记录当前子串的长度。用pointer记录当前不重复的字串开始位置
若出现重复,则tempRes的初始值为i-used[s[i]](就是该字母上一次出现的位置到当前位置,能保证之前的不重复),同时将pointer更新为used[s[i]+1],即该字母重复出现的次数的下一个。字符串标记从1开始,所以一开始要加一个随机字符(这里是q)上代码
int lengthOfLongestSubstring(string s) { string temp=""; int i=0,length=s.length(),ans=0,pointer=1,tempRes=0; if(length==0) return 0; int used[500]={0}; temp+="q"; temp+=s; length=temp.length(); for(i=1;i<length;i++) { if(used[temp[i]]==0||used[temp[i]]<pointer) { tempRes++; used[temp[i]]=i; } else { pointer=used[temp[i]]+1; ans=max(tempRes,ans); tempRes=i-used[temp[i]]; used[temp[i]]=i; } } ans=max(tempRes,ans); return ans; }
0 0
- Longest Substring Without Repeating Characters
- Longest Substring Without Repeating Characters
- Longest Substring Without Repeating Characters
- Longest Substring Without Repeating Characters
- Longest Substring Without Repeating Characters
- Longest Substring Without Repeating Characters
- Longest Substring Without Repeating Characters
- Longest Substring Without Repeating Characters
- Longest Substring Without Repeating Characters
- Longest Substring Without Repeating Characters
- Longest Substring Without Repeating Characters
- Longest Substring Without Repeating Characters
- Longest Substring Without Repeating Characters
- Longest Substring Without Repeating Characters
- Longest Substring Without Repeating Characters
- Longest Substring Without Repeating Characters
- Longest Substring Without Repeating Characters
- Longest Substring Without Repeating Characters
- iOS设计模式——委托(delegate)
- mkmapView的应用
- leetcode 77. Combinations-排列|递归|非递归|Java|Python
- 怎么用ChemDraw Prime 15绘制立体化学结构
- iOS 8 AutoLayout与Size Class自悟
- Longest Substring Without Repeating Characters
- (二)第二章:大数据底层技术通用架构概要介绍
- 开源社区
- VS2015永久配置OPENCV3.0
- iOS设计模式——单例模式
- Excel大量导出
- 加上这些小“心机”,投简历才有回音!
- spring概述
- 【c++】映射表std::map