Golang | Leetcode Golang题解之第564题寻找最近的回文数

题目：

题解：

func nearestPalindromic(n string) string {m := len(n)candidates := []int{int(math.Pow10(m-1)) - 1, int(math.Pow10(m)) + 1}selfPrefix, _ := strconv.Atoi(n[:(m+1)/2])for _, x := range []int{selfPrefix - 1, selfPrefix, selfPrefix + 1} {y := xif m&1 == 1 {y /= 10}for ; y > 0; y /= 10 {x = x*10 + y%10}candidates = append(candidates, x)}ans := -1selfNumber, _ := strconv.Atoi(n)for _, candidate := range candidates {if candidate != selfNumber {if ans == -1 ||abs(candidate-selfNumber) < abs(ans-selfNumber) ||abs(candidate-selfNumber) == abs(ans-selfNumber) && candidate < ans {ans = candidate}}}return strconv.Itoa(ans)
}func abs(x int) int {if x < 0 {return -x}return x
}