-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathreverse_string.go
65 lines (51 loc) · 1.26 KB
/
reverse_string.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
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
package main
import (
"strings"
)
func main() {
}
// ok
func reverseStringArrayFields(s string) string {
// para evitar espacios extras
values := strings.Fields(s)
// 2 indices uno con valor 0 y otro con el largo del array
// intercambiar a la hora de devolver array
for i, j := 0, len(values)-1; i < j; i, j = i+1, j-1 {
// swap words string,
values[i], values[j] = values[j], values[i]
}
return strings.Join(values, " ")
}
// aproximado, espacios extras al final
func reverseStringFieldsBuilder(s string) string {
values := strings.Fields(s)
builder := strings.Builder{}
for i, j := 0, len(values)-1; j >= 0; i, j = i+1, j-1 {
// swap words string
builder.WriteString(values[j])
builder.WriteString(" ")
}
return builder.String()
}
func mirrorStringBytes(s string) string {
a := []byte(s) // to byte
// Reverse en a
for i, j := 0, len(a)-1; i < j; i, j = i+1, j-1 {
a[i], a[j] = a[j], a[i]
}
return string(a)
}
func mirrorStringRunes(s string) string {
rns := []rune(s) // to rune
for i, j := 0, len(rns)-1; i < j; i, j = i+1, j-1 {
// swap letters string,
rns[i], rns[j] = rns[j], rns[i]
}
return string(rns)
}
func mirrorStringLikeRunes(str string) (result string) {
for _, v := range str {
result = string(v) + result
}
return
}