LeetCode-9-Palindrome Number(C语言实现)
2017-12-22 18:44
330 查看
bool isPalindrome(int x) {
if(x < 0)
return false;
long long num = (long long)x; //使用long long型变量防止反转时越界
long long test = 0;
while(num)
{
test = test * 10 + num % 10;
num /= 10;
}
if(x == test)
return true;
else
return false;
}
if(x < 0)
return false;
long long num = (long long)x; //使用long long型变量防止反转时越界
long long test = 0;
while(num)
{
test = test * 10 + num % 10;
num /= 10;
}
if(x == test)
return true;
else
return false;
}
相关文章推荐
- LeetCode-62-Unique Paths(C语言实现)
- [leetcode]Reverse Linked List II (反转链表值 C语言实现)
- LeetCode-7-Reverse Integer(C语言实现)
- LeetCode-19-Remove Nth Node From End of List(C语言实现)
- LeetCode-21-Merge Two Sorted Lists(C语言实现)
- [leetcode]Merge Sorted Array (两个有序数组的合并 C语言实现)
- [leetcode]Length of Last Word (求最后一个单词的长度 C语言实现)
- LeetCode-6-ZigZag Conversion(C语言实现)
- [leetcode] Excel Sheet Column Title (excel表格的数字转字母表示格式) C语言实现
- LeetCode-747-Min Cost Climbing Stairs(C语言实现)
- [leetcode]Same Tree(判断两个二叉树是否相等 C语言实现)
- LeetCode-26-Remove Duplicates from Sorted Array(C语言实现)
- [leetcode]Count and Say (伯爵说 C语言实现)
- LeetCode-748-Largest Number At Least Twice of Others(C语言实现)
- LeetCode-27-Remove Element(C语言实现)
- LeetCode-42-Trapping Rain Water(C语言实现)
- LeetCode-63-Unique Paths II(C语言实现)
- LeetCode-5-Longest Palindromic Substring(C语言实现)
- [leetcode]Symmetric Tree (对称树 C语言实现)
- LeetCode-18-4Sum(C语言实现)