-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path557.go
45 lines (40 loc) · 1001 Bytes
/
557.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
package main
import (
"fmt"
)
func main() {
fmt.Println(reverseWords("Let's take LeetCode contest"))
}
//给定一个字符串,你需要反转字符串中每个单词的字符顺序,同时仍保留空格和单词的初始顺序。
//
//示例 1:
//
//输入: "Let's take LeetCode contest"
//输出: "s'teL ekat edoCteeL tsetnoc"
//注意:在字符串中,每个单词由单个空格分隔,并且字符串中不会有任何额外的空格。
//reverse-words-in-a-string-iii
func reverseWords(s string) string {
startS := 0
var reverseS string
for i := range s {
if s[i] == 32 || i == len(s)-1 {
tmpWord := ""
if s[i] == 32 {
tmpWord = s[startS:i]
reverseS = reverseS + Reverse(tmpWord) + " "
} else {
tmpWord = s[startS:]
reverseS = reverseS + Reverse(tmpWord)
}
startS = i+1
}
}
return reverseS
}
func Reverse(s string) string {
r := []rune(s)
for i, j := 0, len(r)-1; i < j; i, j = i+1, j-1 {
r[i], r[j] = r[j], r[i]
}
return string(r)
}