import java.util.ArrayList;
import java.util.Collections;
public class HBSZ {
public static void main(String[] args) {
//声明两个无序数组
int[] a = { 1, 3, 2 };
int[] b = { 7, 5, 8 };
//声明新数组并定义长度=两个无序数组长度之和
int[] newArray = new int[a.length + b.length];
//先将无序数组a中的所有元素添加到新数组中
for (int i = 0; i < a.length; i++) {
newArray[i] = a[i];
}
//再将无序数组b中的元素添加到新数组中
for (int i = a.length, j = 0; i < a.length + b.length; i++, j++) {
newArray[i] = b[j];
}
//对新数组进行排序
ArrayList arrlist = new ArrayList();
for(int i=0; i<newArray.length;i++){
arrlist.add(newArray[i]);
}
Collections.sort(arrlist);
//输出新数组
System.out.println(arrlist);
}
}