首页 > 代码库 > [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.
编程思想：从后往前逆序把大元素依次填到A中合适的位置。
class Solution {public: void merge(int A[], int m, int B[], int n) { int newIndex = m+n-1; while(m>0 && n>0){ if(A[m-1]>B[n-1]){ A[newIndex]=A[m-1]; m--; newIndex--; }else{ A[newIndex]=B[n-1]; n--; newIndex--; } }//end while while(m>0){ A[newIndex]=A[m-1]; m--; newIndex--; }//end while while(n>0){ A[newIndex]=B[n-1]; n--; newIndex--; }//end while }};
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。