mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-09 03:34:02 +08:00
update反转字符串,添加了python更加简洁的写法
This commit is contained in:
@ -157,7 +157,7 @@ class Solution {
|
|||||||
```
|
```
|
||||||
|
|
||||||
Python:
|
Python:
|
||||||
```python3
|
```python
|
||||||
class Solution:
|
class Solution:
|
||||||
def reverseString(self, s: List[str]) -> None:
|
def reverseString(self, s: List[str]) -> None:
|
||||||
"""
|
"""
|
||||||
@ -168,6 +168,17 @@ class Solution:
|
|||||||
s[left], s[right] = s[right], s[left]
|
s[left], s[right] = s[right], s[left]
|
||||||
left += 1
|
left += 1
|
||||||
right -= 1
|
right -= 1
|
||||||
|
|
||||||
|
# 下面的写法更加简洁,但是都是同样的算法
|
||||||
|
# class Solution:
|
||||||
|
# def reverseString(self, s: List[str]) -> None:
|
||||||
|
# """
|
||||||
|
# Do not return anything, modify s in-place instead.
|
||||||
|
# """
|
||||||
|
# 不需要判别是偶数个还是奇数个序列,因为奇数个的时候,中间那个不需要交换就可
|
||||||
|
# for i in range(len(s)//2):
|
||||||
|
# s[i], s[len(s)-1-i] = s[len(s)-1-i], s[i]
|
||||||
|
# return s
|
||||||
```
|
```
|
||||||
|
|
||||||
Go:
|
Go:
|
||||||
|
Reference in New Issue
Block a user