9. Palindrome Number
来源:互联网 发布:两个表格筛选不同数据 编辑:程序博客网 时间:2024/06/05 07:12
Determine whether an integer is a palindrome. Do this without extra space.
click to show spoilers.
Some hints:
Could negative integers be palindromes? (ie, -1)
If you are thinking of converting the integer to string, note the restriction of using extra space.
You could also try reversing an integer. However, if you have solved the problem “Reverse Integer”, you know that the reversed integer might overflow. How would you handle such case?
There is a more generic way of solving this problem.
bool isPalindrome(int x) { if (x < 0)return false; int len = 0, tmp = x, sum = 0; while (tmp){ tmp /= 10, len++; } for (int i = 0; i < len / 2; i++){ sum = sum * 10 + (x % 10); x /= 10; } if (len & 0x1)x /= 10; return sum == x;}
阅读全文
0 0
- LeetCode 9. Palindrome Number
- [LeetCode]9.Palindrome Number
- LeetCode --- 9. Palindrome Number
- LeetCode 9.Palindrome Number
- [Leetcode] 9. Palindrome Number
- 9.Palindrome Number
- 9. Palindrome Number
- 9. Palindrome Number
- Problem 9.Palindrome Number
- 【leetcode】 9. palindrome number
- 9.Palindrome Number
- [LeetCode] 9.Palindrome Number
- 9. Palindrome Number
- LeetCode : 9. Palindrome Number
- 9. Palindrome Number
- LeetCode 9.Palindrome Number
- 9. Palindrome Number
- 9. Palindrome Number
- c++ primer plus阅读笔记7---模板特化
- Java集合之HashSet源码分析
- eclipse中常用的快捷键
- APPIUM 框架简述
- 堆和栈的区别
- 9. Palindrome Number
- 有关最短路径
- Hibernate--与Spring整合及增删改查
- Java集合之HashMap源码分析
- 基于JavaScript与css实现网页随机抽奖功能
- JAVA_基础
- 安装pip
- Linux命令(13)——cut命令
- 明明的随机数问题,亲测通过