首页 > 代码库 > Merge Sorted Array
Merge Sorted Array
Merge Sorted Array
Given two sorted integer arrays A and B, merge B into A as one sorted array.
Note:
You may assume that A has enough space (size that is greater or equal to m + n) to hold additional elements from B. The number of elements initialized in A and B are m andn respectively.
1 public class Solution { 2 public void merge(int A[], int m, int B[], int n) { 3 int temp[] = new int[m + n]; 4 int i = 0; 5 int j = 0; 6 int k = 0; 7 while(i < m && j < n && B.length != 0){ 8 if(A[i] < B[j]) 9 temp[k++] = A[i++];10 else11 temp[k++] = B[j++];12 }13 while(i < m)14 temp[k++] = A[i++];15 while(j < n)16 temp[k++] = B[j++];17 System.arraycopy(temp, 0, A, 0, temp.length);18 19 }20 }
Merge Sorted Array
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。