首页 > 代码库 > [Leetcode] Merge Sorted Array
[Leetcode] 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 mand n respectively.
Solution: 从后往前推。
1 public class Solution { 2 public void merge(int A[], int m, int B[], int n) { 3 int i=m+n-1; 4 int j=m-1; 5 int k=n-1; 6 while(j>=0&&k>=0){ 7 A[i--]=(A[j]>B[k])?A[j--]:B[k--]; 8 } 9 while(k>=0){10 A[i--]=B[k--];11 }12 }13 }
[Leetcode] Merge Sorted Array
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。