穿过雾的阴霾

摘要： class Solution{ public: string str; int i=0; int cnt[256]={0}; //Insert one char from stringstream void insert(char c){ str+=c; cnt[c]++; } //return t 阅读全文

摘要： class Solution { public: int longestSubstringWithoutDuplication(string s) { int len=0,n=s.size(),cnt[30]; memset(cnt,0,sizeof cnt); for (int i = 0,j = 阅读全文