leetcode 009 Palindrome Number

最新推荐文章于 2020-08-18 15:23:01 发布

weixin_30865427

最新推荐文章于 2020-08-18 15:23:01 发布

阅读量48

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/WillsCheng/p/5418575.html

本文介绍了一种简单的方法来判断一个整数是否为回文数。通过将整数转化为字符串，然后比较字符串前后对应的字符是否相同来实现。适用于初学者理解和实现。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

9. Palindrome Number

Total Accepted: 119423 Total Submissions: 378311 Difficulty: Easy

Determine whether an integer is a palindrome. Do this without extra space.

click to show spoilers.

Subscribe to see which companies asked this question

Have you met this question in a real interview?

package com.archer;
/**
 * 
 * @author Archer
 *	题解：判断是否是回文数，吧整数转换成String 然后就很简单了
 */
public class Solution {
    public boolean isPalindrome(int x) {
    	String tmp = x + "";
    	boolean odd = true ;
    	int len = tmp.length();
    	int left;int right;
    	
    	if(len%2 == 0)
    		odd =false;
    	
    	left = len/2 - 1;
    	if(odd){
    		right = len/2 + 1;
    	}else{
    		right = len/2;
    	}
    	
    	while(left>=0 && right <len){
			if(tmp.charAt(left) != tmp.charAt(right))
				return false;
			left--;right++;
		}
    	
        return true;
    }
}

转载于:https://www.cnblogs.com/WillsCheng/p/5418575.html