首页 > 其他 > 详细

Merge Sorted Array--LeetCode

时间:2015-04-13 12:53:09      阅读:105      评论:0      收藏:0      [点我收藏+]

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的空间够,那么从后往前开始填充即可

void merge(int A[], int m, int B[], int n) 
{
   int i,j=m-1;
   int cur= m+n-1;
   for(i=n-1;i>=0;)
   {
      if(A[j] > B[i])
       A[cur--] = A[j--];
      else
       A[cur--] = B[i--];             
   }     
}


Merge Sorted Array--LeetCode

原文:http://blog.csdn.net/yusiguyuan/article/details/45023657

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!