两个数组合并,去掉重复的然后再排序
- package hb.array_unite_collate;
- import java.util.ArrayList;
- import java.util.Arrays;
- import java.util.HashSet;
- import java.util.Iterator;
- import java.util.Set;
- public class Test {
- /**
- * 两个数组合并,去掉重复的,然后再排序
- */
- public static void main(String[] args) {
- int[] arr2 = {1,2,3,4,5};
- int[] arr1 = {3,4,5,6,7};
- //Set是不允许重复的,所以将数组的值全部放在Set对象中
- Set set = new HashSet<Integer>();
- for(int i = 0; i < arr1.length ; i++){
- set.add(arr1[i]);
- }
- for(int i = 0; i < arr2.length ; i++){
- set.add(arr2[i]);
- }
- //得到的是不重复的值,Set的长度
- System.out.println(set.size());
- Iterator i = set.iterator();
- int[] arrays = new int[set.size()];
- int num=0;
- while(i.hasNext()){
- int a = (Integer)i.next();
- arrays[num] = a;
- num = num + 1;
- System.out.println(num);
- }
- for(int s = 0; s < arrays.length ; s++){
- System.out.println(arrays[s]);
- }
- //对结果进行排序
- Arrays.sort(arrays);
- for(int s = 0; s < arrays.length ; s++){
- System.out.println(arrays[s]);
- }
- }