Title Link: https://leetcode.com/problems/reverse-integer/
Topic:
Reverse digits of an integer.
Example1: x = 123, return 321
Example2: x = -123, return-321
Ideas:
Pay attention to positive and negative conditions
Algorithm:
[Java]View PlainCopy
- public   int reverse ( int x) {
- Char c[] = string.valueof (Math.Abs (x)). ToCharArray ();
- for (inti =0; i < c.length/2; i++) {
- char tmp = c[c.length - i - 1 ];&NBSP;&NBSP;
- c[c.length - 1 - i] = c[i];
- C[i] = tmp;
- }
- try &NBSP;{&NBSP;&NBSP;
- if (x >= ) Span class= "number" style= "margin:0px; padding:0px; Border:none; Color:rgb (192,0,0); Background-color:inherit ">0
- return integer.parseint ( String.valueof (c));
- } else &NBSP;{&NBSP;&NBSP;
- return -integer.parseint ( String.valueof (c));
- &NBSP;&NBSP;&NBSP;&NBSP;&NBSP;&NBSP;&NBSP;&NBSP;}&NBSP;&NBSP;
- } catch (numberformatexception e) {
- return &NBSP; 0 ;&NBSP;&NBSP;
- }
- }
"Leetcode" Reverse Integer