leetcode: Reverse Integer
2014-02-22 21:07
369 查看
主要问题:
-100->-1
0->0
这两种边界情况
public class Solution {
public static int reverse(int x) {
if(x==0)
return 0;
String s=String.valueOf(x);
int n=s.length();
char[] ca=new char
;
ca=s.toCharArray();
int i,j;
int sn=0;
for(i=n-1;i>=0;i--)
if(ca[i]!='0')
break;
char[] ca_rvs=new char[i+1];
if(ca[0]=='-')
{
sn=1;
ca_rvs[0]='-';
}
for(j=i;j>=sn;j--)
{
ca_rvs[i-j+sn]=ca[j];
}
s=new String(ca_rvs);
return Integer.parseInt(s);
}
}
-100->-1
0->0
这两种边界情况
public class Solution {
public static int reverse(int x) {
if(x==0)
return 0;
String s=String.valueOf(x);
int n=s.length();
char[] ca=new char
;
ca=s.toCharArray();
int i,j;
int sn=0;
for(i=n-1;i>=0;i--)
if(ca[i]!='0')
break;
char[] ca_rvs=new char[i+1];
if(ca[0]=='-')
{
sn=1;
ca_rvs[0]='-';
}
for(j=i;j>=sn;j--)
{
ca_rvs[i-j+sn]=ca[j];
}
s=new String(ca_rvs);
return Integer.parseInt(s);
}
}
相关文章推荐
- LeetCode: Reverse Integer
- LeetCode-7 Reverse Integer(倒置整型数)
- leetcode Reverse Integer
- LeetCode Reverse Integer
- Reverse Integer 翻转数字@LeetCode
- [LeetCode] Reverse Integer 解题报告
- LeetCode Reverse Integer
- [LeetCode]:Reverse Integer(Only两类解法)
- leetcode:Reverse Integer(反转数字)【算法面试题】
- 007 Reverse Integer [Leetcode]
- LeetCode之Reverse Integer
- leetcode Reverse Integer
- LeetCode - Reverse Integer - Frequent
- Leetcode_Reverse Integer(考虑了溢出情况)
- 【LeetCode】(7)Reverse Integer(Easy)
- 【python】【leetcode】【算法题目7—Reverse Integer】
- Reverse Integer(leetcode)
- LeetCode: Reverse Integer
- Leetcode Reverse Integer
- leetcode_07_Reverse Integer (easy)