首页 > 代码库 > 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.
插入一个新元素会导致插入位置后面的所有元素的移动,为避免大量的移动,通常的办法就是从后面到前面插入,即反向插入和移动元素
void merge(int A[], int m, int B[], int n) { int indexA = m-1, indexB = n-1, index = m+n-1; while(indexB>=0 && indexA >=0 ){ if(B[indexB] > A[indexA]) A[index--] = B[indexB--]; else A[index--] = A[indexA--]; } while(indexB>=0) A[index--] = B[indexB--]; }
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。