class Solution { public int reverse(int x) { if (x == 0) { return 0; } StringBuilder sb = new StringBuilder(); Long xx = Long.parseLong(String.valueOf(x)); if (xx < 0) { sb.append("-"); xx = -xx; } while (xx != 0) { Long one = xx % 10; sb.append(String.valueOf(one)); xx /= 10; } Long result = Long.parseLong(String.valueOf(sb)); if (result > Integer.MAX_VALUE || result < Integer.MIN_VALUE) { return 0; } return Integer.parseInt(String.valueOf(result)); } }
LeetCode - 7. 反转整数
猜你喜欢
转载自blog.51cto.com/tianyiya/2171985
今日推荐
周排行