Commit 45e286b

committed

feat: add solutions to leetcode problem: No.1047

1 parent 9ff99f4 commit 45e286bCopy full SHA for 45e286b

File tree

+77

-11

lines changed

+77

-11

lines changed

Lines changed: 32 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -34,22 +34,52 @@`
`34`	`34`
`35`	`35`	`<!-- 这里可写通用的实现逻辑 -->`
`36`	`36`
	`37`	`+栈实现。`
	`38`	`+`
	`39`	`+遍历字符串 S 中的每个字符 s,若栈为空或者栈顶值不等于字符 s,s 入栈,否则栈顶元素出栈。`
	`40`	`+`
	`41`	`+最后返回栈中元素所组成的字符串。`
	`42`	`+`
`37`	`43`	`<!-- tabs:start -->`
`38`	`44`
`39`	`45`	`### Python3`
`40`	`46`
`41`	`47`	`<!-- 这里可写当前语言的特殊实现逻辑 -->`
`42`	`48`
`43`	`49`	```python
`44`		`-`
	`50`	`+class Solution:`
	`51`	`+ def removeDuplicates(self, S: str) -> str:`
	`52`	`+ res = []`
	`53`	`+ for s in S:`
	`54`	`+ if not res or res[-1] != s:`
	`55`	`+ res.append(s)`
	`56`	`+ else:`
	`57`	`+ res.pop()`
	`58`	`+ return ''.join(res)`
`45`	`59`	```
`46`	`60`
`47`	`61`	`### Java`
`48`	`62`
`49`	`63`	`<!-- 这里可写当前语言的特殊实现逻辑 -->`
`50`	`64`
`51`	`65`	```java
`52`		`-`
	`66`	`+class Solution {`
	`67`	`+ public String removeDuplicates(String S) {`
	`68`	`+ StringBuilder sb = new StringBuilder();`
	`69`	`+ int top = -1;`
	`70`	`+ for (int i = 0, n = S.length(); i < n; ++i) {`
	`71`	`+ char s = S.charAt(i);`
	`72`	`+ if (top == -1 \|\| sb.charAt(top) != s) {`
	`73`	`+ sb.append(s);`
	`74`	`+ ++top;`
	`75`	`+ } else {`
	`76`	`+ sb.deleteCharAt(top);`
	`77`	`+ --top;`
	`78`	`+ }`
	`79`	`+ }`
	`80`	`+ return sb.toString();`
	`81`	`+ }`
	`82`	`+}`
`53`	`83`	```
`54`	`84`
`55`	`85`	`### ...`

Lines changed: 26 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -42,13 +42,37 @@ For example, in "abbaca" we could remove "bb" since the lett`
`42`	`42`	`### Python3`
`43`	`43`
`44`	`44`	```python
`45`		`-`
	`45`	`+class Solution:`
	`46`	`+ def removeDuplicates(self, S: str) -> str:`
	`47`	`+ res = []`
	`48`	`+ for s in S:`
	`49`	`+ if not res or res[-1] != s:`
	`50`	`+ res.append(s)`
	`51`	`+ else:`
	`52`	`+ res.pop()`
	`53`	`+ return ''.join(res)`
`46`	`54`	```
`47`	`55`
`48`	`56`	`### Java`
`49`	`57`
`50`	`58`	```java
`51`		`-`
	`59`	`+class Solution {`
	`60`	`+ public String removeDuplicates(String S) {`
	`61`	`+ StringBuilder sb = new StringBuilder();`
	`62`	`+ int top = -1;`
	`63`	`+ for (int i = 0, n = S.length(); i < n; ++i) {`
	`64`	`+ char s = S.charAt(i);`
	`65`	`+ if (top == -1 \|\| sb.charAt(top) != s) {`
	`66`	`+ sb.append(s);`
	`67`	`+ ++top;`
	`68`	`+ } else {`
	`69`	`+ sb.deleteCharAt(top);`
	`70`	`+ --top;`
	`71`	`+ }`
	`72`	`+ }`
	`73`	`+ return sb.toString();`
	`74`	`+ }`
	`75`	`+}`
`52`	`76`	```
`53`	`77`
`54`	`78`	`### ...`

Lines changed: 10 additions & 7 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,14 +1,17 @@`
`1`	`1`	`class Solution {`
`2`	`2`	`public String removeDuplicates(String S) {`
`3`		`- char[] cs = new char[S.length()];`
	`3`	`+ StringBuildersb = new StringBuilder();`
`4`	`4`	`int top = -1;`
`5`		`- for (char c : S.toCharArray()) {`
`6`		`- if (top >= 0 && c == cs[top]) {`
`7`		`- --top;`
	`5`	`+ for (int i = 0, n = S.length(); i < n; ++i) {`
	`6`	`+ char s = S.charAt(i);`
	`7`	`+ if (top == -1 \|\| sb.charAt(top) != s) {`
	`8`	`+ sb.append(s);`
	`9`	`+ ++top;`
`8`	`10`	`} else {`
`9`		`- cs[++top] = c;`
	`11`	`+ sb.deleteCharAt(top);`
	`12`	`+ --top;`
`10`	`13`	`}`
`11`	`14`	`}`
`12`		`- return String.valueOf(cs, 0, top + 1);`
	`15`	`+ return sb.toString();`
`13`	`16`	`}`
`14`		`-}`
	`17`	`+}`

Lines changed: 9 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,9 @@`
	`1`	`+class Solution:`
	`2`	`+ def removeDuplicates(self, S: str) -> str:`
	`3`	`+ res = []`
	`4`	`+ for s in S:`
	`5`	`+ if not res or res[-1] != s:`
	`6`	`+ res.append(s)`
	`7`	`+ else:`
	`8`	`+ res.pop()`
	`9`	`+ return ''.join(res)`

Comments

(0)