Question

Have the user enter an integer nbetween 100 and 999.  If the integer does not satisfy the given criteria (not in the correct range), or if the entered value is not an integer (use method hasNextInt(). have the user reenter an integer

Create an integer kthat is the reverse of n.   NOTE: k must be an integer

Display k.

Repeat

The program will stop when the user enters 0 (create a sentinel).

Example of the programs output:

Please enter an integer between 100 and 999:

Enter 0 if you want to exit

9000

The integer is not in the correct range/type

Please enter an integer between 1 and 999:

Enter 0 if you want to exit

20.5

The integer is not in the correct range/type

Please enter an integer between 100 and 999:

Enter 0 if you want to exit

670

The reverse of n = 678, is 876

Please enter an integer between 100 and 999:

Answer 1

code:

import java.io.*;
import java.util.*;
public class Test{
   public static void main(String args[]){
       int num;
       Scanner sc = new Scanner(System.in);
       System.out.println("Please enter an integer between 100 and 999:");
       System.out.println("Enter 0 if you want to exit");
       while(sc.hasNext()){
           if(sc.hasNextInt()){
               num = sc.nextInt(10);
               if(num == 0 )
                   break;
               if(num >= 100 && num <= 999){
                   System.out.println("The reverse of n = " + num + ", is " + reverse(num));

               }else{
                   System.out.println("The integer is not in the correct range/type");
               }
           }else{
               System.out.println("The integer is not in the correct range/type");
               sc.next();
           }
           System.out.println("Please enter an integer between 100 and 999:");
           System.out.println("Enter 0 if you want to exit");
       }
       sc.close();
   }
   public static int reverse(int num){
       int new_num = 0, remainder;
       while(num != 0){
           remainder = num % 10;
           new_num = new_num * 10 + remainder;
           num = num / 10;
       }
       return new_num;
   }
}

output: