Java 先合并去重复数字,再用冒泡算法
整形数组合并
http://www.nowcoder.com/questionTerminal/c4f11ea2c886429faf91decfaf6a310b
import java.io.*;
import java.util.ArrayList;
public class Main
{
public static void main(String[] args) throws IOException
{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String str1;
while((str1 = br.readLine()) != null)
{
ArrayList<Integer> list = new ArrayList<Integer>();
String str2 = br.readLine();
String[] arr1 = str2.split(" ");
for(int i = 0; i< Integer.parseInt(str1); i++)
{
list.add(Integer.parseInt(arr1[i]));
}
String str3 = br.readLine();
String str4 = br.readLine();
String[] arr2 = str4.split(" ");
for(int i = 0; i< Integer.parseInt(str3); i++)
{
list.add(Integer.parseInt(arr2[i]));
}
int num = Integer.parseInt(str1) + Integer.parseInt(str3);
ArrayList<Integer> list2 = new ArrayList<Integer>();
for(int i = 0; i < num; i++)
{
if(!list2.contains(list.get(i)))
{
list2.add(list.get(i));
}
}
int num2 = list2.size();
bubble(num2, list2);
for(int i = 0; i < num2; i++)
{
System.out.print(list2.get(i));
}
System.out.println("");
}
}
public static void bubble(int n, ArrayList<Integer> list2)
{
if(n == 1)
{
return;
}
for(int i = 0; i < n-1; i++)
{
if(list2.get(i) > list2.get(i + 1))
{
int a = list2.get(i + 1);
list2.set(i + 1, list2.get(i));
list2.set(i, a);
}
}
bubble(n - 1, list2);
}
}

