LeetCode练习-字符串-longest-substring-without-repeating-characters
来源:互联网 发布:网络黄金骗局举报电话 编辑:程序博客网 时间:2024/06/18 09:05
题目描述
Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for "abcabcbb" is "abc", which the length is 3. For "bbbbb" the longest substring is "b", with the length of 1.
思路:滑动窗口
eg: abcabcbb,
a
ab
abc
bca
cab
......
类似与deque,若子串中有当前字符,则把子串中当前字符及前边的字符都删除并清空对应的标志位,最后把当前字符添加到尾部;
若子串中没有当前字符,则直接把当前字符添加到子串尾部,并设置对应的标志位。
代码:
/*longest-substring-without-repeating-characters*/int lengthOfLongestSubstring(string s);bool charIsInSubString(deque<char> d, char c);//判断当前字符是否已在子串中int lengthOfLongestSubstring_2(string s);//改进了判断当前字符是否已在子串中。int lengthOfLongestSubstring_3(string s);//改进了deque,用两个变量begin和end来模拟deque。int main(){//char c = 'a';//deque<char> d;//d.push_back('a');//d.push_back('b');//cout << charIsInSubString(d, c) << endl;string s = "wlrbbmqbhcdarzowkkyhiddqscdxrjmowfrxsjybldbefsarcbynecdyggxxpklorellnmpapqfwkhopkmco";//string s= "abcabcbb";//string s= "bbbbb";cout << lengthOfLongestSubstring_3(s) << endl;return 0;}int lengthOfLongestSubstring_3(string s){bool flag[255] = {0};int max=0;int count = 0;int i;int begin=0, end=0;for(i = 0; i < s.length(); ++i){if(!flag[s[i]]){flag[s[i]] = true;++end;++count;if(count > max)max = count;}else{int j;for(j = begin; s[j] != s[i]; ++j){flag[s[j]] = false;++begin;--count;}++begin;--count;++end;++count;if(count > max)max = count;}}return max;}int lengthOfLongestSubstring_2(string s){//运行时间8ms,内存492kbool flag[255] = {0};//ostream_iterator<char> out_it(cout, " ");int max=0;deque<char> d;int count = 0;int i;for(i = 0; i < s.length(); ++i){if(!flag[s[i]]){flag[s[i]] = true;d.push_back(s[i]);++count;if(count > max)max = count;}else{deque<char>::iterator dIter = d.begin();for(; *dIter != s[i]; ++dIter){flag[d.front()] = false;d.pop_front();--count;}d.pop_front();--count;d.push_back(s[i]);++count;if(count > max)max = count;}//copy(d.begin(), d.end(), out_it);//cout << " " << "count: " << count << " max: "<< max << endl;}return max;}int lengthOfLongestSubstring(string s){//运行时间20ms,内存492kostream_iterator<char> out_it(cout, " ");int max=0;deque<char> d;int count = 0;int i;for(i = 0; i < s.length(); ++i){if(!charIsInSubString(d, s[i])){d.push_back(s[i]);++count;if(count > max)max = count;}else{deque<char>::iterator dIter = d.begin();for(; *dIter != s[i]; ++dIter){d.pop_front();--count;}d.pop_front();--count;d.push_back(s[i]);++count;if(count > max)max = count;}//copy(d.begin(), d.end(), out_it);//cout << " " << "count: " << count << " max: "<< max << endl;}return max;}bool charIsInSubString(deque<char> d, char c){deque<char>::iterator dIter;dIter = find(d.begin(), d.end(), c);if(dIter == d.end())return false;elsereturn true;}
阅读全文
0 0
- LeetCode练习-字符串-longest-substring-without-repeating-characters
- leetcode---longest-substring-without-repeating-characters---字符串
- [编程练习][Longest Substring Without Repeating Characters]<LeetCode-3>
- Leetcode练习 #3Longest Substring Without Repeating Characters
- LeetCode--Longest Substring Without Repeating Characters(字符串Hash)
- LeetCode: Longest Substring Without Repeating Characters
- LeetCode Longest Substring Without Repeating Characters
- LeetCode: Longest Substring Without Repeating Characters
- [Leetcode] Longest Substring Without Repeating Characters
- leetcode 23: Longest Substring Without Repeating Characters
- [LeetCode] 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-Longest Substring Without Repeating Characters
- [LeetCode] Longest Substring Without Repeating Characters
- [LeetCode] Longest Substring Without Repeating Characters
- Unity如何使用WWW类和协程完成图片、视频下载播放
- js监听页面到底部
- 时间格式处理
- web前端开发面试问题总结
- 二次上线之价目表项目编号还是旧料号解决办法
- LeetCode练习-字符串-longest-substring-without-repeating-characters
- 微服务架构
- tempate类型参数和非类型参数和callback
- android 实现透明的沉浸式状态栏
- 简单的CPU和内存负载测试
- android Paint画笔的基本使用
- UNIX网络编程卷1:套接字联网API-第一部分:简介
- Android 实现微信登录
- 基于FPGA的VGA显示,简单的历程和注释(DE2-115)