-
Notifications
You must be signed in to change notification settings - Fork 7.1k
/
Copy path1.5-回文判断.go
62 lines (50 loc) · 927 Bytes
/
1.5-回文判断.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
//1.5 回文判断
//@author leiyonglin <leiyonglin@gmail.com>
//http://play.golang.org/p/K4NyYq-Teo
package main
import (
"fmt"
)
//解法一
func isPalindrome(s string) bool {
l := len(s)
if l < 1 {
return false
}
left := 0
right := l - 1
for left < right {
if s[left] != s[right] {
return false
}
left++
right--
}
return true
}
//解法二
func isPalindrome2(s string) bool {
l := len(s)
if l < 1 {
return false
}
m := l / 2
left := m - 1
right := m + l%2
for left >= 0 {
if s[left] != s[right] {
return false
}
left--
right++
}
return true
}
func main() {
s := "madam"
fmt.Printf("字符串%s是否为回文:%v \n", s, isPalindrome(s))
fmt.Printf("字符串%s是否为回文:%v \n", s, isPalindrome2(s))
s = "david"
fmt.Printf("字符串%s是否为回文:%v \n", s, isPalindrome(s))
fmt.Printf("字符串%s是否为回文:%v \n", s, isPalindrome2(s))
}