longest substring with two unique charachters
来源：互联网 发布：linux wait源码分析 编辑：程序博客网 时间：2024/06/12 00:30
O(n)双指针。
code
#include <iostream>#include <climits>#include <cmath>#include <string>#include <cstring>using namespace std;string longest(string str){ int longest = 0;int longest_start = -1;int occurance[256];int count = 0;memset(occurance, 0, sizeof(occurance));int len = str.size();int start = 0;for(size_t i = 0; i<len; i++){occurance[str[i]]++; if(occurance[str[i]] == 1) count++; if(count == 3) { cout << i << "start" << endl; if(i-start > longest) { longest = i-start; longest_start = start; cout << i << " longest " << longest << endl; } while(count == 3) { occurance[str[start]]--; if(occurance[str[start]] == 0) count--; start++; } } } if(len - start > longest) { longest = len-start; longest_start = start; } return str.substr(longest_start, longest);}int main(){ cout << longest("aabadefghaabbaa") << endl; return 0;} 0 0
- longest substring with two unique charachters
- [Leetcode] Longest Substring with At Most Two Distinct Characters
- Leetcode Longest Substring with At Most Two Distinct Characters
- leetcode 159: Longest Substring with At Most Two Distinct Characters
- Longest Substring with At Most Two Distinct Characters
- [Leetcode]Longest Substring with At Most Two Distinct Characters
- Longest Substring with At Most Two Distinct Characters
- LeetCode - Longest Substring with At Most Two Distinct Characters
- Leetcode: Longest Substring with At Most Two Distinct Characters
- 159Longest Substring with At Most Two Distinct Characters
- [LeetCode160]Longest Substring with At Most Two Distinct Characters
- Leetcode-159.Longest Substring with At Most Two Distinct Characters
- Leetcode-159.Longest Substring with At Most Two Distinct Characters
- Leetcode 159 Longest Substring with At Most Two Distinct Characters
- [LeetCode]159. Longest Substring with At Most Two Distinct Characters
- 159. Longest Substring with At Most Two Distinct Characters
- LeetCode 159. Longest Substring with At Most Two Distinct Characters
- Longest Substring with At Most Two Distinct Characters
- 短信拦截木马背后的黑色产业
- 哈夫曼树的构建
- SSH bash紧急安全补丁！重要！
- 求三角形的面积
- 写在学java之前
- longest substring with two unique charachters
- android中计量单位DIP DP SP PX PT的区别
- 【Stackoverflow好问题】Java修饰符：public，protected，private，不加修饰符。有什么区别呢？
- 排列组合问题求解
- Android sqlite 简单操作
- EditText属性详解
- java.io.EOFException解决
- 配置Mavericks的LDAP client使其可以登录ubuntu上的OpenLDAP server
- DataSet基本用法
