HW6.5

 

 1 import java.util.Scanner;
 2 
 3 public class Solution
 4 {
 5     public static void main(String[] args)
 6     {
 7         Scanner input = new Scanner(System.in);
 8         System.out.print("Enter 10 numbers: ");
 9 
10         int[] number1 = new int[10];
11         int[] number2 = new int[10];
12 
13         for(int i = 0; i < 10; i++)
14             number1[i] = input.nextInt();
15 
16         input.close();
17 
18         for(int i = 0; i < 10; i++)
19         {
20             if(contain(number2, number1[i]))
21                 continue;
22             add(number2, number1[i]);
23         }
24 
25         System.out.print("The distinct numbers are: ");
26         for(int i: number2)
27             if(i != 0)
28                 System.out.print(i + " ");
29     }
30 
31     public static boolean contain(int[] array, int n)
32     {
33         for(int i: array)
34             if(i == n)
35                 return true;
36         return false;
37     }
38 
39     public static void add(int[] array, int n)
40     {
41         for(int i = 0; i < array.length; i++)
42             if(array[i] == 0)
43             {
44                 array[i] = n;
45                 break;
46             }
47     }
48 }

 

转载于:https://www.cnblogs.com/wood-python/p/5805494.html