mirror of
https://github.com/halfrost/LeetCode-Go.git
synced 2025-08-03 02:47:26 +08:00
61 lines
1.3 KiB
Markdown
61 lines
1.3 KiB
Markdown
# [344. Reverse String](https://leetcode.com/problems/reverse-string/)
|
|
|
|
## 题目
|
|
|
|
Write a function that reverses a string. The input string is given as an array of characters char[].
|
|
|
|
Do not allocate extra space for another array, you must do this by modifying the input array in-place with O(1) extra memory.
|
|
|
|
You may assume all the characters consist of printable ascii characters.
|
|
|
|
**Example 1**:
|
|
|
|
```
|
|
|
|
Input: ["h","e","l","l","o"]
|
|
Output: ["o","l","l","e","h"]
|
|
|
|
```
|
|
|
|
**Example 2**:
|
|
|
|
```
|
|
|
|
Input: ["H","a","n","n","a","h"]
|
|
Output: ["h","a","n","n","a","H"]
|
|
|
|
```
|
|
|
|
## 题目大意
|
|
|
|
题目要求我们反转一个字符串。
|
|
|
|
## 解题思路
|
|
|
|
这一题的解题思路是用 2 个指针，指针对撞的思路，来不断交换首尾元素，即可。
|
|
|
|
|
|
|
|
## 代码
|
|
|
|
```go
|
|
|
|
package leetcode
|
|
|
|
func reverseString(s []byte) {
|
|
for i, j := 0, len(s)-1; i < j; {
|
|
s[i], s[j] = s[j], s[i]
|
|
i++
|
|
j--
|
|
}
|
|
}
|
|
|
|
```
|
|
|
|
|
|
----------------------------------------------
|
|
<div style="display: flex;justify-content: space-between;align-items: center;">
|
|
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0343.Integer-Break/">⬅️上一页</a></p>
|
|
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0345.Reverse-Vowels-of-a-String/">下一页➡️</a></p>
|
|
</div>
|