-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path2000-ReversePrefixOfWord.go
More file actions
73 lines (64 loc) · 2.53 KB
/
2000-ReversePrefixOfWord.go
File metadata and controls
73 lines (64 loc) · 2.53 KB
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
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
package main
// 2000. Reverse Prefix of Word
// Given a 0-indexed string word and a character ch,
// reverse the segment of word that starts at index 0 and ends at the index of the first occurrence of ch (inclusive).
// If the character ch does not exist in word, do nothing.
// For example, if word = "abcdefd" and ch = "d", then you should reverse the segment that starts at 0 and ends at 3 (inclusive).
// The resulting string will be "dcbaefd".
// Return the resulting string.
// Example 1:
// Input: word = "abcdefd", ch = "d"
// Output: "dcbaefd"
// Explanation: The first occurrence of "d" is at index 3.
// Reverse the part of word from 0 to 3 (inclusive), the resulting string is "dcbaefd".
// Example 2:
// Input: word = "xyxzxe", ch = "z"
// Output: "zxyxxe"
// Explanation: The first and only occurrence of "z" is at index 3.
// Reverse the part of word from 0 to 3 (inclusive), the resulting string is "zxyxxe".
// Example 3:
// Input: word = "abcd", ch = "z"
// Output: "abcd"
// Explanation: "z" does not exist in word.
// You should not do any reverse operation, the resulting string is "abcd".
// Constraints:
// 1 <= word.length <= 250
// word consists of lowercase English letters.
// ch is a lowercase English letter.
import "fmt"
func reversePrefix(word string, ch byte) string {
arr, start, end := []byte(word), 0, 0
// 找到第一个出现在 ch
for i, v := range arr {
if v == ch {
end = i
break
}
}
for start < end {
arr[start], arr[end] = arr[end], arr[start] // 交换字符串
start++
end--
}
return string(arr)
}
func main() {
// Example 1:
// Input: word = "abcdefd", ch = "d"
// Output: "dcbaefd"
// Explanation: The first occurrence of "d" is at index 3.
// Reverse the part of word from 0 to 3 (inclusive), the resulting string is "dcbaefd".
fmt.Println("abcdefd => ", reversePrefix("abcdefd", 'd')) // "dcbaefd"
// Example 2:
// Input: word = "xyxzxe", ch = "z"
// Output: "zxyxxe"
// Explanation: The first and only occurrence of "z" is at index 3.
// Reverse the part of word from 0 to 3 (inclusive), the resulting string is "zxyxxe".
fmt.Println("xyxzxe => ", reversePrefix("xyxzxe", 'z')) // "zxyxxe"
// Example 3:
// Input: word = "abcd", ch = "z"
// Output: "abcd"
// Explanation: "z" does not exist in word.
// You should not do any reverse operation, the resulting string is "abcd".
fmt.Println("abcd => ", reversePrefix("abcd", 'z')) // "abcd"
}