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