例如,
package main
import (
"fmt"
)
func main() {
toCheck := "987654321"
fmt.Println(toCheck)
toSum := make([]int, 0, len(toCheck)/2)
for i := len(toCheck) - 2; i >= 0; i -= 2 {
c := toCheck[i]
if c >= '0' && c <= '9' {
toSum = append(toSum, int(c-'0'))
}
}
fmt.Println(len(toSum), cap(toSum), toSum)
}
游乐场:https://play.golang.org/p/wtIgqEKj-Bk
输出:
987654321
4 4 [2 4 6 8]
这是围棋。代码应该是相当有效的。例如,
$ go test sum_test.go -bench=. -benchmem
BenchmarkPeterSO-8 50000000 24.5 ns/op 32 B/op 1 allocs/op
BenchmarkTom-8 20000000 77.6 ns/op 56 B/op 3 allocs/op
BenchmarkUser10753492-8 20000000 79.0 ns/op 56 B/op 3 allocs/op
BenchmarkGrissom-8 20000000 108 ns/op 56 B/op 3 allocs/op
$
sum_test.go:
package main
import (
"strconv"
"testing"
)
// https://play.golang.org/p/wtIgqEKj-Bk
func BenchmarkPeterSO(b *testing.B) {
toCheck := "987654321"
for N := 0; N < b.N; N++ {
toSum := make([]int, 0, len(toCheck)/2)
for i := len(toCheck) - 2; i >= 0; i -= 2 {
c := toCheck[i]
if c >= '0' && c <= '9' {
toSum = append(toSum, int(c-'0'))
}
}
}
}
// https://play.golang.org/p/KgQrbesy5rT
func BenchmarkTom(b *testing.B) {
toCheck := "987654321"
for N := 0; N < b.N; N++ {
var toSum []int
for i := len(toCheck) - 2; i >= 0; i = i - 2 {
toSum = append(toSum, int(toCheck[i]))
}
}
}
func ByteToInt(c byte) (int, bool) {
if c >= '0' && c <= '9' {
return int(c - '0'), true
} else {
return 0, false
}
}
// https://play.golang.org/p/MRqtgY0ugZY
func BenchmarkUser10753492(b *testing.B) {
toCheck := "987654321"
for N := 0; N < b.N; N++ {
var toSum []int
for i := len(toCheck) - 2; i >= 0; i = i - 2 {
var digit, _ = ByteToInt(toCheck[i])
toSum = append(toSum, digit)
}
}
}
// https://play.golang.org/p/kNbQVn8GJ9R
func BenchmarkGrissom(b *testing.B) {
toCheck := "987654321"
for N := 0; N < b.N; N++ {
var toSum []int
for i := len(toCheck) - 2; i >= 0; i = i - 2 {
v, _ := strconv.Atoi(string(toCheck[i]))
toSum = append(toSum, v)
}
}
}