Java 程序用于创建两个未排序数组的排序合并数组
javaobject oriented programmingprogramming更新于 2024/12/22 8:12:17
要创建两个未排序数组的排序合并数组，首先，让我们创建两个未排序数组−
int[] arr1 = new int[] {50, 22, 15, 40, 65, 75};
int[] arr2 = new int[] {60, 45, 10, 20, 35, 56};
现在让我们创建一个新的结果数组，该数组将具有合并数组−
示例
int count1 = arr1.length;
int count2 = arr2.length;
int [] resArr = new int[count1 + count2];
现在，我们将合并结果数组 resArr 中的两个数组:
while (i < arr1.length){
resArr[k] = arr1[i];
i++;
k++;
}
while (j < arr2.length){
resArr[k] = arr2[j];
j++;
k++;
}
现在让我们看完整的示例
示例
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.stream.Collectors;
public class Demo {
public static void main(String[] args){
int[] arr1 = new int[] {50, 22, 15, 40, 65, 75};
int[] arr2 = new int[] {60, 45, 10, 20, 35, 56};
System.out.println("1st Array = "+Arrays.toString(arr1));
System.out.println("第二个数组 = "+Arrays.toString(arr2));
int count1 = arr1.length;
int count2 = arr2.length;
int [] resArr = new int[count1 + count2];
int i=0, j=0, k=0;
while (i < arr1.length) {
resArr[k] = arr1[i];
i++;
k++;
}
while (j < arr2.length) {
resArr[k] = arr2[j];
j++;
k++;
}
Arrays.sort(resArr);
System.out.println("已排序的合并数组 = "+Arrays.toString(resArr));
}
}
输出
第一个数组 = [50, 22, 15, 40, 65, 75] 第二个数组 = [60, 45, 10, 20, 35, 56] 已排序的合并数组 = [10, 15, 20, 22, 35, 40, 45, 50, 56, 60, 65, 75]
相关文章
有用资源
java 参考教程 - 该教程包含有关 java 的更多信息:https://www.cainiaomax.com/java/
