java实现求一个数组里最大值和最小值之前缺省的数的算法

 1 package test;
 2 
 3 public class Test {
 4 
 5     static int[] array = {
 6             -10,0,3,3,9
 7     };
 8     
 9     private static void printEmptyItems(int[] array) {
10         if (array == null) {
11             return;
12         }
13         
14         int min = array[0];
15         int max = array[0];
16         for (int i = 0; i <array.length; ++i) {
17             if (array[i] > max) {
18                 max = array[i];
19             }
20             if (array[i] < min) {
21                 min = array[i];
22             }
23         }
24         
25         int newLength = max - min;
26         System.out.println("min:" + min + "max:" + max + "new length is:" + newLength);
27         int []newArray = new int[newLength];
28         for (int i = 0; i < newLength; i++) {
29             newArray[i] = min + i;
30         }
31         
32         for (int i = 0; i < array.length; ++i) {
33             if (array[i] >= min && array[i] < max) {
34                 newArray[array[i] - min] = max + 1;
35             }
36         }
37         
38         for (int i = 0; i < newLength; i++) {
39             if (newArray[i] != max + 1) {
40                 System.out.println("empty item is:" + newArray[i]);
41             }
42         }
43     }
44     
45     public static void main(String[] args) {
46         // TODO Auto-generated method stub
47         printEmptyItems(array);
48     }
49 
50 }