Commit 78d7f36

committed

0003

1 parent e072871 commit 78d7f36Copy full SHA for 78d7f36

File tree

2 files changed

+44

-4

lines changed

0003_Longest_Substring_Without_Repeating_Characters.md
README.md

2 files changed

+44

-4

lines changed

`‎0003_Longest_Substring_Without_Repeating_Characters.md‎`

Lines changed: 42 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -2,21 +2,60 @@`
`2`	`2`
`3`	`3`	`#### (1)思路`
`4`	`4`
	`5`	`+滑动构造子串,使子串内字母唯一,取子串的最大长度。`
	`6`	`+第一次提交,出现错误,"tmmzuxt",预期5,输出4。原因是子串左侧没有动态删除元素。`
	`7`	`+第二次提交,出现错误,"aabaab!bb",预期3,输出2。原因是子串右侧没有动态增补。`
	`8`	`+第三次提交,成功。`
	`9`	`+`
`5`	`10`	`#### (2)实现`
`6`	`11`
`7`	`12`	```cpp
`8`	`13`	`class Solution {`
`9`	`14`	`public:`
`10`	`15`	`int lengthOfLongestSubstring(string s) {`
	`16`	`+ string s1;`
	`17`	`+ string::iterator it1, it2;`
	`18`	`+ int len, len_max;`
	`19`	`+`
	`20`	`+ len = 0;`
	`21`	`+ it1 = s.begin();`
	`22`	`+ it2 = it1;`
	`23`	`+`
	`24`	`+ if(it2 == s.end())`
	`25`	`+ return 0;`
	`26`	`+`
	`27`	`+ it2++;`
	`28`	`+ len = 1;`
	`29`	`+ len_max = 1;`
	`30`	`+ s1 = s.substr(0, 1);`
	`31`	`+`
	`32`	`+ while(it2 != s.end()){`
	`33`	`+ if(-1 == s1.find(*it2)){`
	`34`	`+ s1.push_back(*it2);`
	`35`	`+ len++;`
	`36`	`+ len_max = (len > len_max)? len :len_max;`
	`37`	`+ }`
	`38`	`+ else{`
	`39`	`+ s1.push_back(*it2); //第二次提交忘加:不管有没有发现都要加进来,因为s1要滑动`
	`40`	`+ while(it1++ != it2)`
	`41`	`+ s1.erase(0, 1); //第一次提交忘加`
`11`	`42`
	`43`	`+ s1.erase(0, 1); //第一次提交忘加`
	`44`	`+ len = it2 - it1 + 1;`
	`45`	`+ }`
	`46`	`+`
	`47`	`+ it2++;`
	`48`	`+ }`
	`49`	`+`
	`50`	`+ return len_max;`
`12`	`51`	`}`
`13`	`52`	`};`
`14`	`53`	```
`15`	`54`
`16`		`-再`
`17`		`-`
`18`	`55`	`\| 提交结果 \| 执行用时 (pctl%) \| 内存消耗 (pctl%) \| 语言 \|`
`19`	`56`	`\|:---------\|:-----------------\|:-----------------\|:-----\|`
`20`		`-\| 通过 \| ms (%) \| MB (%) \| cpp \|`
	`57`	`+\| 通过 \| 24 ms (52.4%) \| 9.4 MB (63.06%) \| cpp \|`
`21`	`58`
`22`	`59`	`#### (3)收获`
	`60`	`+`
	`61`	`+对动态构造(滑动)的序列,头尾的动态增删细节一定要细心。`

`‎README.md‎`

Lines changed: 2 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -2,7 +2,7 @@`
`2`	`2`
`3`	`3`	`[0001 两数之和][1],2020年02月28日`
`4`	`4`	`[0002 两数相加][2],2020年03月02日`
`5`		`-0003 无重复字符的最长子串`
	`5`	`+[0003 无重复字符的最长子串][3],2020年03月05日`
`6`	`6`	`0004 寻找两个有序数组的中位数`
`7`	`7`	`0005 最长回文子串`
`8`	`8`	`0006 Z 字形变换`
`@@ -1262,3 +1262,4 @@ LCP_5 发 LeetCoin`
`1262`	`1262`
`1263`	`1263`	`[1]: https://github.com/ksd04/leetcode_alg_practice/blob/master/0001_Two_Sum.md`
`1264`	`1264`	`[2]: https://github.com/ksd04/leetcode_alg_practice/blob/master/0002_Add_Two_Numbers.md`
	`1265`	`+[3]: https://github.com/ksd04/leetcode_alg_practice/blob/master/0003_Longest_Substring_Without_Repeating_Characters.md`

0 commit comments

Comments

(0)

Navigation Menu

Search code, repositories, users, issues, pull requests...

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Commit 78d7f36

File tree

2 files changed

2 files changed

`‎0003_Longest_Substring_Without_Repeating_Characters.md‎`

`‎README.md‎`

0 commit comments