algorithm/LeetCode-Go
1
0
Fork 0
mirror of https://github.com/halfrost/LeetCode-Go.git synced 2025-07-06 01:15:57 +08:00
Code Issues Packages Projects Releases Wiki Activity

Fix 0009 solution

Browse Source
This commit is contained in:
YDZ
2021-03-04 14:15:46 +08:00
parent 3f3026ca05
commit 21fda4f75f
20 changed files with 296 additions and 216 deletions
Download Patch File Download Diff File Expand all files Collapse all files

26
leetcode/0009.Palindrome-Number/9. Palindrome Number.go
View File

@ -2,7 +2,33 @@ package leetcode
import "strconv"
// 解法一
func isPalindrome(x int) bool {
if x < 0 {
return false
}
if x == 0 {
return true
}
if x%10 == 0 {
return false
}
arr := make([]int, 0, 32)
for x > 0 {
arr = append(arr, x%10)
x = x / 10
}
sz := len(arr)
for i, j := 0, sz-1; i <= j; i, j = i+1, j-1 {
if arr[i] != arr[j] {
return false
}
}
return true
}
// 解法二 数字转字符串
func isPalindrome1(x int) bool {
if x < 0 {
return false
}

27
leetcode/0009.Palindrome-Number/README.md
View File

@ -49,7 +49,33 @@ package leetcode
import "strconv"
// 解法一
func isPalindrome(x int) bool {
if x < 0 {
return false
}
if x == 0 {
return true
}
if x%10 == 0 {
return false
}
arr := make([]int, 0, 32)
for x > 0 {
arr = append(arr, x%10)
x = x / 10
}
sz := len(arr)
for i, j := 0, sz-1; i <= j; i, j = i+1, j-1 {
if arr[i] != arr[j] {
return false
}
}
return true
}
// 解法二 数字转字符串
func isPalindrome1(x int) bool {
if x < 0 {
return false
}
@ -66,4 +92,5 @@ func isPalindrome(x int) bool {
return true
}
```