我想按升序將兩個排序數組放入一個數組中,但我並沒有做錯。以升序合併兩個數組
它不會把它們放在一起,只需將兩個數組組合在一起即可。
int [] merged = new int[count1 + count2];
int merg1 = 0, merg2 = 0, index = 0;
while (merg1 < count1 && merg2 < count2) {
if (ary1[merg1] <= ary2[merg2]) {
merged[index++] = ary1[merg1++];
}
else {
merged[index++] = ary2[merg2++];
}
while (merg1 < count1) {
merged[index++] = ary1[merg1++];
}
while (merg2 < count2) {
merged[index++] = ary2[merg2++];
}
for (int i = 0; i < index; i++) {
System.out.print(merged[i] + " ");
}
沒有while循環它會打印出凌亂的整數:( – user3225344