【leetcode】9. Palindrome Number

最新推荐文章于 2021-06-23 13:41:47 发布

AXIMI

最新推荐文章于 2021-06-23 13:41:47 发布

阅读量236

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/AXIMI/article/details/83069008

版权

leetcode 专栏收录该内容

257 篇文章 2 订阅

订阅专栏

Description：

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

Example1:

Input: 121
Output: true

Example2:

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.

[ 题目链接 ]

提交代码：

bool isPalindrome(int x) {
   if(x < 0)	return false;
   if (x == 0)	return true;
	
	int i=0,len=0,tmp,nums[11];

	while (x)
	{
		tmp = x % 10;
		nums[i++] = tmp;
		x /= 10;
		len++;
	}

	for (i = 0; i < len / 2 + 1; i++)
	{
		if (nums[i] != nums[len - i-1])
			return false;
	}

	return true; 
}