LeetCode暖身-Palindrome Number

LeetCode暖身-Palindrome Number

Given an integer x, return true if x is a 

palindrome, and false otherwise.

Example 1:

Input: x = 121
Output: true
Explanation: 121 reads as 121 from left to right and from right to left.

Example 2:

Input: x = -121
Output: false
Explanation: From left to right, it reads -121. From right to left, it becomes 121-. Therefore it is not a palindrome.

Example 3:

Input: x = 10
Output: false
Explanation: Reads 01 from right to left. Therefore it is not a palindrome.

Constraints:

  • -231 <= x <= 231 - 1
My Answer:
public class Solution {
    public bool IsPalindrome(int x) {
        string xStr = x.ToString();

        string reverseXStr = new string(xStr.Reverse().ToArray());

        return xStr == reverseXStr;
    }
}

註: 一時間會想直接拆字串一正一反比對,後來想一下好像有一個reverse的function可以用

發佈留言

發佈留言必須填寫的電子郵件地址不會公開。 必填欄位標示為 *