mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-08 16:54:50 +08:00
0844.比较含退格的字符串.md, 增加Python, Golang实现
This commit is contained in:
@ -188,8 +188,49 @@ class Solution {
|
||||
|
||||
Python:
|
||||
|
||||
python3
|
||||
|
||||
```python
|
||||
class Solution:
|
||||
|
||||
def get_string(self, s: str) -> str :
|
||||
bz = []
|
||||
for i in range(len(s)) :
|
||||
c = s[i]
|
||||
if c != '#' :
|
||||
bz.append(c) # 模拟入栈
|
||||
elif len(bz) > 0: # 栈非空才能弹栈
|
||||
bz.pop() # 模拟弹栈
|
||||
return str(bz)
|
||||
|
||||
def backspaceCompare(self, s: str, t: str) -> bool:
|
||||
return self.get_string(s) == self.get_string(t)
|
||||
pass
|
||||
```
|
||||
|
||||
|
||||
Go:
|
||||
|
||||
```go
|
||||
|
||||
func getString(s string) string {
|
||||
bz := []rune{}
|
||||
for _, c := range s {
|
||||
if c != '#' {
|
||||
bz = append(bz, c); // 模拟入栈
|
||||
} else if len(bz) > 0 { // 栈非空才能弹栈
|
||||
bz = bz[:len(bz)-1] // 模拟弹栈
|
||||
}
|
||||
}
|
||||
return string(bz)
|
||||
}
|
||||
|
||||
func backspaceCompare(s string, t string) bool {
|
||||
return getString(s) == getString(t)
|
||||
}
|
||||
|
||||
```
|
||||
|
||||
JavaScript:
|
||||
|
||||
-----------------------
|
||||
|
Reference in New Issue
Block a user