Multiply the reverse number by 10 and add modulo value into the reverse number.

// Java program to reverse a number class GfG { static int reverseDigits(int n) { int revNum = 0; while (n > 0) { revNum = revNum * 10 + n % 10; n = n / 10; } return revNum; } public static void main(String[] args) { int num = 4562; ...

2) Multiply the reverse number by 10 and add a modulo value to the reverse number. 3) Divide the number by 10. 4) Repeat the above steps until the number becomes zero. Using recursion function: The recursion operator in Java allows you to repeat ...

// Java program to reverse the number // using a stack import java.util.Stack; public class GFG { // Stack to maintain order of digits static Stack<Integer> st= new Stack<>(); // Function to push digits into stack static void push_digits(int number) { while(number != 0) { st.push(number % 10); number = number / 10; } } // Function to reverse the number static int reverse_number(int number) { // Function call to push number's // digits to stack push_digits(number); int reverse = 0; int i = 1; // Popping the digits and forming // the reversed number while (!st.isEmpty()) { reverse = reverse + (st.peek() * i); st.pop(); i = i * 10; } // Return the reversed number formed return reverse; } // Driver program to test above function public static void main(String[] args) { int number = 39997; System.out.println(reverse_number(number)); } } // This code is contributed by Sumit Ghosh ·

Explanation: Characters are stored in a list and reversed using Collections.reverse(). This approach is helpful when you’re already working with Java collections.