LeetCode 7. Reverse Integer
来源:互联网 发布:围棋 人工智能算法 编辑:程序博客网 时间:2024/06/05 23:52
Reverse digits of an integer.
Example1: x = 123, return 321
Example2: x = -123, return -321
click to show spoilers.
Note:
The input is assumed to be a 32-bit signed integer. Your function should return 0 when the reversed integer overflows.
Subscribe to see which companies asked this question.
反转一个整数。
public class Solution { public int reverse(int x) { long a = 0; while(x!=0){ a = a*10 + x%10; x = x/10; } if(a>Integer.MAX_VALUE||a<Integer.MIN_VALUE){ return 0; } return (int)a; }}
0 0
- [LeetCode]7.Reverse Integer
- LeetCode 7. Reverse Integer
- LeetCode --- 7. Reverse Integer
- LeetCode 7.Reverse Integer
- [Leetcode] 7. Reverse Integer
- [Leetcode]7.Reverse Integer
- LeetCode 7.Reverse integer
- [LeetCode] 7.Reverse Integer
- 7. Reverse Integer LeetCode
- leetcode 7. Reverse Integer
- leetcode 7. Reverse Integer
- leetcode 7. Reverse Integer
- Leetcode 7. Reverse Integer
- 【LeetCode】7.Reverse Integer
- LeetCode 7. Reverse Integer
- LeetCode *** 7. Reverse Integer
- LeetCode 7. Reverse Integer
- LeetCode-7. Reverse Integer
- LeetCode代码分析——22. Generate Parentheses(DFS模板题)
- 排错+组合数
- 理解OAuth 2.0
- 常用排序算法之堆排序
- Populating Next Right Pointers in Each Node II
- LeetCode 7. Reverse Integer
- 我的第一个程序hello word及注释
- 常用排序算法之归并排序
- 销售员业绩管理程序设计
- linux 取文本的指定行的内容
- MySql 5.7 zip 安装
- 常用排序算法之快速排序
- Java概念性问题3
- Super Pow