首页 > 代码库 > [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 m andn respectively.
思路：从后往前复制，注意两个数组都为空或者其中一个数组为空的情况。
时间复杂度O(n),空间复杂度O(1)
1 class Solution { 2 public: 3 void merge(int A[], int m, int B[], int n) { 4 if (n == 0) 5 return; 6 int index = m + n - 1; 7 int ia = m - 1; 8 int ib = n - 1; 9 while (index >= 0) {10 const int val_a = ia == -1 ? INT_MIN : A[ia];11 const int val_b = ib == -1 ? INT_MIN : B[ib];12 if (val_a > val_b) {13 A[index--] = val_a;14 --ia;15 } else {16 A[index--] = val_b;17 --ib;18 }19 }20 }21 };
[LeetCode] Merge Sorted Array
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。