首页 > 代码库 > LeetCode: Merge Sorted Array
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 and n respectively.
地址：https://oj.leetcode.com/problems/merge-sorted-array/
直接给代码吧：
1 class Solution { 2 public: 3 void merge(int A[], int m, int B[], int n) { 4 if(m < 0 || n <= 0) return ; 5 int i_A = m - 1, i_B = n - 1; 6 int i_AB = m + n - 1; 7 while(i_A >= 0 && i_B >= 0){ 8 if(A[i_A] < B[i_B]){ 9 A[i_AB--] = B[i_B--];10 }else{11 A[i_AB--] = A[i_A--];12 }13 }14 while(i_B >= 0){15 A[i_AB--] = B[i_B--];16 }17 return ;18 }19 };
LeetCode: Merge Sorted Array
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。