Numerical inversion algorithm and inversion algorithm

Numerical inversion algorithm and inversion algorithm

I encountered an algorithm question during the interview today and asked to put a number upside down. At that time, I had a slight flaw in my answers on paper. I came back and made some special improvements. I have already passed the debugging, I hope to provide a little help to the interviewees in the future. The following code is attached:

Public class NumberInversion {public static void main (String [] args) {int num = 123456; char [] nums = String. valueOf (num ). toCharArray (); for (int I = 0; I <nums. length/2; I ++) {if (I! = Nums. length-1-i) {char temp = nums [I]; nums [I] = nums [nums. the length-1-i]; nums [nums. length-1-i] = temp ;}for (char str: nums) {System. out. print (str );}}}