在 java 中按升序合並 2 個排序數組

Question

我正在嘗試在 java 中合並 2 個升序排序數組。 我是 java 的新手，所以我無法理解。 以下代碼有什么問題？

import java.lang.Math;
import java.util.Scanner;

public class Main
{   
  public static void main(String[] args) {
    int[] a = {10, 20, 30, 40};
    int[] b = {50, 60, 70, 80};
    int[] z = merge(a, b);
    System.out.println(z);
  }

  public static int[] merge(int[] a, int[] b) {
    int[] result = new int[a.length + b.length];
    int indexResult = 0;
    int indexA = 0;
    int indexB = 0;

    while (indexResult < result.length) {
      if (indexB >= a.length || a[indexA] <= b[indexB])
        result[indexResult++] = b[indexB++];
      else
        result[indexResult++] = a[indexA++]; 
    }
    return result;
   }
 }

我的錯誤是

Exception in thread "main" java.lang.ArrayIndexOutOfBoundsException: 4                                                                         
        at Main.merge(Main.java:30)                                                                                                            
        at Main.main(Main.java:15)

Answer 1

indexB >= a.length應替換為 indexA >= indexA >= a.length 。

以下代碼可能會有所幫助

import java.lang.Math;
import java.util.Scanner;
public class Main
{   
public static void main(String[] args) {
     int[] a = {10, 20, 30, 40};
    int[] b ={50,60,70,80};
    int[] z=merge( a, b);
    for(int x: z)
        System.out.println(x);

}
public static int[] merge(int[] a, int[] b) {

        int[] result = new int[a.length + b.length];
        int indexResult = 0;
        int indexA = 0;
        int indexB = 0;

        while (indexResult < result.length) {
            if (indexA >= a.length || a[indexA] >= b[indexB])
                result[indexResult++] = b[indexB++];
            else
                result[indexResult++] = a[indexA++];
        }
        return result;
    }
}

OUTPUT:-

10
20
30
40
50
60
70
80

Answer 2

有許多不同的方法可以合並 2 個 arrays。這是另一個例子：

  public class Main {
    public static void main(String[] args) {
        int[] a = { 10, 20, 30, 40 };
        int[] b = { 50, 60, 70, 80 };
        merge(a, b);

    }

    public static void merge(int[] a, int[] b) {

        int[] z = new int[a.length + b.length];
        int count = 0;

        for (int i = 0; i < a.length; i++) {
            z[i] = a[i];
            count++;
        }
        for (int j = 0; j < b.length; j++) {
            z[count++] = b[j];
        }
        for (int i = 0; i < z.length; i++)
            System.out.print(z[i] + " ");
    }

}

Output：

10 20 30 40 50 60 70 80