两升序数组合并成一个升序数组
package test; import java.util.Arrays; public class LArray { public static void main(String[] args){ int[] a={2,6,7,8}; int[] b={4,6,66,77,88,99,444,666,777,999}; int[] c = uninArray(a,b); System.out.println(Arrays.toString(c)); } public static int[] uninArray(int[] a,int[] b){ int left=0,mid=0,third=0; int[] tmpArr=new int[a.length+b.length]; while (left< a.length && mid< b.length) { // 从两个数组中取出最小的放入中间数组 if (a[left] <= b[mid]) { tmpArr[third++] = a[left++]; } else { tmpArr[third++] = b[mid++]; } } // 剩余部分依次放入中间数组 while (mid < b.length) { tmpArr[third++] = b[mid++]; } while (left <a.length) { tmpArr[third++] = a[left++]; } return tmpArr; } }
声明:该文观点仅代表作者本人,牛骨文系教育信息发布平台,牛骨文仅提供信息存储空间服务。