LeetCode 算法刷题(7)
2017-03-22 13:27
134 查看
7. Reverse Integer
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.
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 Test7 { public static void main(String[] args){ Test7 test = new Test7(); System.out.print(test.reverse(-10)); } public int reverse(int x) { try{ int index = 0; if(x<0){ index = 1; } String s = String.valueOf(x); char[] c = s.toCharArray(); int last = s.length()-1; for(int i=index,j=last;i<=j;i++,j--){ char temp = c[i]; c[i] = c[j]; c[j] = temp; } return new Integer(Integer.parseInt(new String(c))); }catch(NumberFormatException e){ return 0; } } }
相关文章推荐
- [leetcode.com]算法题目 - Remove Duplicates from Sorted List
- leetcode -- 一个算法面试题相关的网站
- leetcode:Longest Substring Without Repeating Characters (双指针扫描) 【面试算法题】
- leetcode:Merge Intervals(合并相交集合) 【面试算法题】
- [leetcode.com]算法题目 - Length of Last Word
- 算法。递归。之一: combination sum, leetcode
- Longest Valid Parentheses(最长的括号匹配)【面试算法leetcode】
- [leetcode.com]算法题目 - Restore IP Addresses
- leetcode:Median of Two Sorted Arrays (找两个序列的中位数,O(log (m+n))限制) 【面试算法】
- [leetcode.com]算法题目 - Triangle
- [leetcode.com]算法题目 - Pascal's Triangle
- leetcode:Distinct Subsequences (不同的子序列)【面试算法题】
- Longest Palindromic Substring (最长回文串)【面试算法leetcode】
- [leetcode.com]算法题目 - Jump Game
- [leetcode.com]算法题目 - Same Tree
- [leetcode.com]算法题目 - Decode Ways
- [leetcode.com]算法题目 - Maximum Subarray
- Maximal Rectangle (求矩阵的最大的子矩阵) 【面试算法leetcode】
- [leetcode.com]算法题目 - Sqrt(x)
- leetcode:Merge k Sorted Lists(按大小顺序连接k个链表)【面试算法题】