题解 | #整型数组合并#

这个题相对比较简单，只需要用Set去重，配合List排序即可。

public class Main {    
  public static void main(String[] args) {       
	Scanner in = new Scanner(System.in);      
	while (in.hasNext()) {           
	  int m = in.nextInt();           
	  int[] firArr = new int[m];           
	  for (int i = 0; i < m; i++) {            
		firArr[i] = in.nextInt();           
	  }           
	  int n = in.nextInt();         
	  int[] sendArr = new int[n];      
	  for (int i = 0; i < n; i++) {            
		sendArr[i] = in.nextInt();        
	  }          
	  Set<Integer> sets = new HashSet<>();        
	  Arrays.stream(firArr).forEach(sets::add);            
	  Arrays.stream(sendArr).forEach(sets::add);      
	  List<Integer> list = new ArrayList<>(sets);      
	  Collections.sort(list);           
	  StringBuilder sb = new StringBuilder();       
	  list.forEach(sb::append);          
	  System.out.println(sb);       
	}   
  }
}