Reverse digits of an integer.
Example1: x = 123, return 321
Example2: x = -123, return -321
click to show spoilers.
这题挺简单的,我用了一个比较取巧的方式。效率不会太高。可以用普通的方式来做,那样效率会高很多。
public class Solution {
public int reverse(int x) {
int i = 0;
boolean b = x>0?true:false;
int temp = b?x:-x;
String str = null;
if(temp >0){
str = ""+temp;
}else{
str = "2147483648";
}
char[] a = str.toCharArray();
String end = "";
for(int j = a.length-1;j>=0;j--){
end += a[j];
}
end = end.compareTo("2147483647")>0&&b?end.substring(0, end.length()):end;
if(end.length()>=10&&end.compareTo("2147483647")>0&&b){
end = "0";
}else if(end.length()>=10&&end.compareTo("2147483648")>0&&!b){
end = "0";
}
if(end.equals("2147483648")){
i = -2147483648;
}else {
i = b?Integer.valueOf(end):-Integer.valueOf(end);
}
return i;
}
}
Example1: x = 123, return 321
Example2: x = -123, return -321
click to show spoilers.
这题挺简单的,我用了一个比较取巧的方式。效率不会太高。可以用普通的方式来做,那样效率会高很多。
public class Solution {
public int reverse(int x) {
int i = 0;
boolean b = x>0?true:false;
int temp = b?x:-x;
String str = null;
if(temp >0){
str = ""+temp;
}else{
str = "2147483648";
}
char[] a = str.toCharArray();
String end = "";
for(int j = a.length-1;j>=0;j--){
end += a[j];
}
end = end.compareTo("2147483647")>0&&b?end.substring(0, end.length()):end;
if(end.length()>=10&&end.compareTo("2147483647")>0&&b){
end = "0";
}else if(end.length()>=10&&end.compareTo("2147483648")>0&&!b){
end = "0";
}
if(end.equals("2147483648")){
i = -2147483648;
}else {
i = b?Integer.valueOf(end):-Integer.valueOf(end);
}
return i;
}
}
发表评论
-
Merge k Sorted Lists
2015-03-12 19:55 323Merge k sorted linked lists and ... -
Generate Parentheses
2015-03-12 19:50 362Given n pairs of parentheses, w ... -
Generate Parentheses
2015-03-05 22:39 0Given n pairs of parentheses, w ... -
Valid Parentheses
2015-03-05 22:33 305Given a string containing just ... -
Remove Nth Node From End of List
2015-03-05 22:31 336Given a linked list, remove the ... -
Letter Combinations of a Phone Number
2015-03-05 22:30 326Letter Combinations of a Phone ... -
4Sum
2015-03-05 22:26 309Given an array S of n integers, ... -
3Sum Closest
2015-03-05 22:25 287Given an array S of n integers, ... -
3Sum
2015-03-03 22:34 316Given an array S of n integers, ... -
Longest Common Prefix
2015-03-03 22:21 324Write a function to find the lo ... -
Roman to Integer
2015-03-03 22:20 323Given a roman numeral, convert ... -
Integer to Roman
2015-03-01 23:35 287Given an integer, convert it to ... -
Container With Most Water
2015-03-01 22:55 319Given n non-negative integers a ... -
Regular Expression Matching
2015-03-01 20:19 362Implement regular expression ma ... -
Palindrome Number
2015-02-13 22:08 329Determine whether an integer is ... -
String to Integer (atoi)
2015-02-13 11:07 336Implement atoi to convert a str ... -
ZigZag Conversion
2015-02-12 23:37 251The string "PAYPALISHIRING ... -
Longest Palindromic Substring
2015-02-12 22:50 330Given a string S, find the long ... -
Add Two Numbers
2015-02-12 22:12 297You are given two linked lists ... -
Longest Substring Without Repeating Characters
2015-02-11 21:14 423[size=24px;]Longest Substring W ...
相关推荐
ReverseInteger算法Demo
Given a 32-bit signed integer, reverse digits of an integer. Java AC版本
js代码-7. Reverse Integer
leetcode leetcode练习 twosum 问题 ;add two numbers问题;reverse integer问题;最大不重复子字符串长度问题;atoi问题;
7. Reverse Integer 9. Palindrome Number 11. Container With Most Water 13. Roman to Integer 15. 3Sum 16. 3Sum Closest 17. Letter Combinations of a Phone Number 18. 4Sum 19. Remove Nth Node From End of ...
leetcode Java 246 題目及解答 (英文) Contents 1 Rotate Array in Java 15 2 Reverse Words in a String II 19 3 Evaluate Reverse Polish Notation 21 ...244 Reverse Integer 591 245 Palindrome Number 593
Reverse digits of an integer. Example1: x = 123, return 321 Example2: x = -123, return -321 click to show spoilers. Have you thought about this? Here are some good questions to ask before coding...
Reverse Integer Palindrome Number Insert Interval Merge Intervals Minimum Window Substring Multiply Strings Substring with Concatenation of All Words Pascal's Triangle Pascal's Triangle II Spiral ...
leetcode 分类 数据结构和算法学习记录,结合LeetCode刷题 分类 DP 目录 题目 解法 分类 Time ...Reverse Integer/ri7.go) ...Reverse Integer/Solution.java) Math O(log(x)) O(1) JAVA Math JAVA Math
Leetcode\ReverseInteger\ReverseInteger.cs 问题: 业绩报告: 回文数 代码: Leetcode\PalindromeNumber\PalindromeNumber.cs 问题: 从排序数组中删除重复项 代码: Leetcode\RemoveDuplicates\RemoveDuplicates....
190 | [Reverse Bits](https://leetcode.com/problems/reverse-bits/) | [C++](./C++/reverse-bits.cpp) [Python](./Python/reverse-bits.py) | _O(1)_ | _O(1)_ | Easy ||| 191 |[Number of 1 Bits]...
第321题Reversed_Integer Java中的LeetCode逆整数问题解决方案 问题 - 给定一个有符号的 32 位整数 x,返回 x 其数字颠倒。 如果反转 x 导致值超出有符号的 32 位整数范围 [-231, 231 - 1],则返回 0。 假设环境不...
Reverse Integer 9. Palindrome Number 11. Container With Most Water 12. Integer to Roman 13. Roman to Integer 14. Longest Common Prefix 15. 3Sum 20. Valid Parentheses 21. Merge Two Sorted Lists 22. ...
Reverse Integer 008 String to Integer (atoi) 009 Palindrome Number 010 Regular Expression Matching 011 Container With Most Water 012 Integer to Roman 013 Roman to Integer 014 Longest Common Prefix 015...
Reverse Integer 简单 字串 String to Integer (atoi) 中等 字串 麻烦 Palindrome Number 简单 字串 Container With Most Water 中等 动态规划 重要 Integer to Roman 中等 重要 Roman to Integer 简单 重要 Longest...
Reverse Integer 008. String to Integer 009. Palindrome Number 010. Regular Expression Matching 011. Container With Most Water 012. Integer to Roman 013. Roman to Integer 014. Longest Common Prefix 019...
Reverse Integer 简单 8 String to Integer (atoi) 中等 9 Palindrome Number 简单 11 Container With Most Water 中等 12 Integer to Roman 中等 13 Roman to Integer 简单 14 Longest Common Prefix 简单 15 3Sum ...
7.Reverse Integer 8.String To Integer 9.Palindrome Number 10.String To Integer 11.Container With Most Water 12.Integer To Roman 13.Roman To Integer 289 347 380 442 457 Circular Array Loop 535 Encode ...
7.Reverse Integer 8.String to Integer (atoi) 9.Palindrome Number 10.Regular Expression Matching 11.Container With Most Water 12.Integer to Roman 13.Roman to Integer 14.Longest Common Prefix (Trie树待...