/**
*
*/
package com.lanou.sethashsetlinkedsettreeset;
import java.util.Arrays;
import java.util.Comparator;
import java.util.HashSet;
import java.util.LinkedHashSet;
import java.util.Random;
import java.util.Set;
import java.util.TreeSet;
/*** <p>Title:SetHashSet </p>
1.返回一个随机数组,要求元素不能重复
2.要求元素从小到大排序
3.要求元素从大到小排序
*/
public class SetHashSet {
public static void main(String[] args) {
int[] random = getRandom(10);
System.out.println("返回一个自定义长度随机数组:");
System.out.println(Arrays.toString(random));
System.out.println(random.length);
int[] arr = getRandom1(10);
System.out.println("返回一个随机数组,元素不重复:");
System.out.println(Arrays.toString(arr));
System.out.println(arr.length);
int[] arr2 = getRandom2(10);
System.out.println("返回一个随机数组,元素从小到大排序不重复:");
System.out.println(Arrays.toString(arr2));
System.out.println(arr2.length);
int[] arr3 = getRandom3(10);
System.out.println("返回一个随机数组,元素从大到小排序不重复:");
System.out.println(Arrays.toString(arr3));
System.out.println(arr3.length);
}
/**
* 返回一个随机数组,元素重复
*/
private static int[] getRandom(int length) {
//定义一个数组,将要传经来的长度等于定义的数组
int[] arr = new int[length];
Random random = new Random();
for(int i=0;i<length;i++) {
arr[i]=random.nextInt(10);
}
return arr;
}
/**
* 返回一个随机数组,元素不能重复
*/
private static int[] getRandom1(int length) {
//定义一个数组,将要传经来的长度等于定义的数组
Set<Integer> set=new HashSet<Integer>();
Random random = new Random();
for (int i = 0; i < length; i++) {
set.add(random.nextInt(20));
}
Integer[] array =set.toArray(new Integer[0]);
int[] arr = new int[set.size()];
for (int i = 0; i < set.size(); i++) {
arr[i] = array[i];
}
return arr;
}
//返回一个长度为10的随机数组,元素从小到大排序
private static int[] getRandom2(int length) {
Set<Integer> set = new TreeSet<Integer>();
Random random = new Random();
while(set.size()<length) {
set.add(random.nextInt(20));
}
Integer[] array= set.toArray(new Integer[0]);
int[] arr = new int[set.size()];
for(int i=0;i<set.size();i++) {
arr[i] = array[i];
}
return arr;
}
//返回一个长度为10的随机数组,元素从大到小排序
private static int[] getRandom3(int length) {
//使用compartor比较器,重写父类方法,o2.compareTO(o1);代表从大到小
Set<Integer> set = new TreeSet<Integer>(new Comparator<Integer>() {
@Override
public int compare(Integer o1, Integer o2) {
return o2.compareTo(o1);
}
});
Random random = new Random();
while(set.size()<length) {
set.add(random.nextInt(20));
}
Integer[] array= set.toArray(new Integer[0]);
int[] arr = new int[set.size()];
for(int i=0;i<set.size();i++) {
arr[i] = array[i];
}
return arr;
}
}