两个数组合并、去重、升序

package com.xianxi;
import java.util.Arrays;
public class Test1_1 {

	/**
	 * 两个数组合并、去重、升序
	 */
	public static void main(String[] args) {
		// TODO 自动生成的方法存根
/*int []a = {1,9,5,7,4};
Arrays.sort(a);
for(int i = 0; i < a.length;i++){
	System.out.println(a[i]+" ");
}*/
		int []a = {10,9,8,7,6,5,4};
		int []b = {1,2,3,4,5,6};
		int []c = new int[a.length+b.length];//定义一个a和b数组长度之和
		System.arraycopy(a,0,c,0,a.length);
		System.arraycopy(b,0 ,c,a.length,b.length );//合并
		int num = 0;
		for(int i = 0; i < c.length-1;i++){   //去重
			for(int j = i+1; j < c.length; j++){
				if(c[i] == c[j]){
					c[j] = -1;
				}
			}
		}
		for(int i = 0; i < c.length;i++){
			if(c[i] !=-1){
				num++;//不重复的数据个数
			}
		}
		int []d = new int [num];
		num = 0;
		for(int i = 0; i < c.length;i++){
			if(c[i] != -1){
				d[num] = c[i];
				num++;
			}
		}
		Arrays.sort(d);
		for(int i = 0; i < d.length;i++){
			System.out.println(d[i]+" ");
		}
	}

}