9. 回文数 - 力扣（LeetCode）

一、Java

class Solution {public boolean isPalindrome(int x) {String s = Integer.toString(x);  // 转换成字符串return new StringBuilder(s).reverse().toString().equals(s);}
}

二、C++

#include <string>
#include <algorithm>
using namespace std;
class Solution {
public:bool isPalindrome(int x) {string s = to_string(x);string t = s;  // t是一个新的字符串对象reverse(s.begin(),s.end());return s == t;}
};

三、Python

class Solution:def isPalindrome(self, x: int) -> bool:s = str(x)return s[::-1] == s

四、JavaScript

var isPalindrome = function(x) {s = x.toString();t = s.split("").reduce((acc, cur) => cur + acc, "");return s === t;
}

五、Go

package mainimport "strconv"func isPalindrome(x int) bool {s := strconv.Itoa(x)runes := []rune(s)for l, r := 0, len(runes)-1; l < r; l, r = l+1, r-1 {runes[l], runes[r] = runes[r], runes[l]}return string(runes) == s
}