LeetCode算法入門- Palindrome Number-day2

Palindrome Number

Determine whether an integer is a palindrome. An integer is a palindrome when it reads the same backward as forward.

Example 1:

Input: 121
Output: true

Example 2:

Input: -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: 10
Output: false
Explanation: Reads 01 from right to left. Therefore it is not a palindrome.

方法一：
將int類型x進行反轉，如果反轉之后和之前的數字一樣，說明是回文，否則不是（記得排除負數的）

class Solution {public boolean isPalindrome(int x) {if(x < 0) return false;//這里是將int類型X進行反轉int reverse = 0;int old = x;while(x != 0){reverse = reverse * 10 + x % 10;x = x / 10;}return reverse == old;} }

總結

以上是生活随笔為你收集整理的LeetCode算法入门- Palindrome Number-day2的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。