合并顺序数组

合并两个数组

给定含有n个元素的有序（非降序）整型数组a和含有m个元素的有序（非降序）整型数组b。合并两个数组中的元素到整型数组c，要求去除重复元素并保持c有序（非降序）。例子如下 a = 1, 2, 4, 8 b = 1, 3, 5, 8 c = 1, 2, 3, 4, 5, 8

public class MergeArray {
public static 
int[] doMerge(int[] a, 
int[] b) {
int[] tmp = new 
int[a.length + b.length];
tmp[0] = 0;
int i = 0, j = 
0, k = 0, count = 0;
while (i <= a.length - 1 && j <= b.length -
1) {
if (a[i] < b[j]) {
if (a[i] != tmp[k]) {
tmp[k++] = a[i++];
count++;
} else {
i++;
}
} else if (a[i] > b[j]) {
if (b[j] != tmp[k]) {
tmp[k++] = b[j++];
count++;
} else {
j++;
}
} else {
if (a[i] != tmp[k]) {
tmp[k++] = a[i++];
count++;
} else {
i++;
}
j++;
}
}

while (i <= a.length - 1) {
if (a[i] != tmp[k]) {
tmp[k++] = a[i++];
count++;
} else {
i++;
}
}

while (j <= b.length - 1) {
if (b[j] != tmp[k]) {
tmp[k++] = b[j++];
count++;
} else {
j++;
}
}

int[] c = new 
int[count];
for (int m = 
0; m <= count - 1 ; m++) {
c[m] = tmp[m];
}

return c;
}

public static 
void main(String[] args) {
int[] a = { 1, 
2, 4, 8 };
int[] b = { 1, 
3, 5, 8 };
int[] c = MergeArray.doMerge(a, b);
for (int i = 
0; i <= c.length - 1; i++) {
System.out.print(c[i] + " ");
}
}
}