Problem: USING JAVA ONLY (using for loops and conditions) Make a Problem that takes two positive integers. A smaller number and bigger number separated by a space. Find all of the numbers that consists of all different digits, inclusive, for example 456 counts but 4456 does not because there is two 4's. Assume that the first integer entered (lower number) is less than or equal to the second integer entered (equal or higher). All of the inputs and outputs are within the size of a normal integer.

Sample outputs and inputs:

Input: 5 13

Output: 8

-(counts 6, 7, 8, 9, 10, 11, 12)

Input: 22 22

Output: 0

-(22 is not good because there are two 2's so the output is 0)

Input: 157 157

Output: 1

Input: 10 90

Output: 73

Input: 1234 123456

Output: 33615

Here is My Java Code so far:

import java.util.Scanner;

public class Problem1 {

public static void main(String[] args) {

// TODO Auto-generated method stub

Scanner reader=new Scanner(System.in);

// Enter two bounds-Seperated by space

System.out.println("Enter Two Integers (Seperated by Space- Lower then higher):");

String numbers= reader.nextLine();

//Gets the numbers as a String and stores them in variables

int space= numbers.indexOf(" ");

String num1= numbers.substring(0,space);

String num2=numbers.substring(space+1);

//Make the numbers Integers

int number1=Integer.parseInt(num1);

int number2=Integer.parseInt(num2);