자바 지정 개수 및 구간 범위 의 중복 되 지 않 는 난수 생 성 배열 에 저장

//      
public void print(Integer[] arr) {
        if(arr != null) {
            for (int i = 0; i < arr.length; i++) {
                if(i == 0) {
                    System.out.print("[");
                }
                System.out.print(arr[i]);

                if(i == arr.length - 1) {
                    System.out.print("]");
                } else {
                    System.out.print(",");
                }

            }
        } else {
            System.out.println("arr is null");
        }
    }


    /**
     *                      0  ,           
     * @param randomVal ---        
     * @param arrSize  ---     
     * @param startZero  ---    0  
     * @return
     * @throws IllegalAccessException
     */
    public Integer[] random(int randomVal, int arrSize, boolean startZero) throws IllegalAccessException {
        if(randomVal < arrSize) {
            throw new IllegalAccessException("randomVal can't less than arrSize");
        } else if (randomVal <= 0) {
            throw new IllegalAccessException("randomVal should more than 0");
        }

        Integer[] arr = new Integer[arrSize];

        for (int i = 0; true;) {
            int val = new Random().nextInt(randomVal);
            if(!startZero) {
                val += 1;
            }
            boolean hasExist = false;
            if(i > 0) {
                for(int j = i - 1; j >= 0; j --) {
                    if (val == arr[j]) {
                        hasExist = true;
                        break;
                    }
                }
            }

            if(!hasExist) {
                arr[i ++] = val;
            }
            if(i == arrSize) {
                break;
            }
        }
        return arr;
    }

print(random(5, 5, false));   //        [1,2,5,4,3] 
print(random(5, 5, true));   //        [0,4,1,3,2] 
print(random(100, 5, true));  //        [45,27,51,99,88]