leetcode9

public class Solution {
    public bool IsPalindrome(int x) {
        if (x < 0)
            {
                return false;
            }
            var str = x.ToString();
            var list = new List<string>();
            foreach (var c in str)
            {
                list.Add(c.ToString());
            }

            var count = list.Count;

            for (int i = 0; i < list.Count; i++)
            {
                var n1 = list[i];
                var n2 = list[list.Count - 1 - i];

                if (n1 != n2)
                {
                    return false;
                }

                if (i >= list.Count - 1 - i)
                {
                    break;
                }
            }
            return true;
    }
}

https://leetcode.com/problems/palindrome-number/#/description

 

补充一个python的实现，使用双指针：

class Solution:
    def isPalindrome(self, x: int) -> bool:
        if x < 0:
            return False
        s = str(x)
        i,j = 0, len(s)-1
        while i < j:
            if s[i] != s[j]:
                return False
            i += 1
            j -= 1
        return True