class Solution {
public:
void merge(int A[], int m, int B[], int n) {
int ia=m-1,ib=n-1,icur=m+n-1;
while(ia>=0&&ib>=0)
{
A[icur--]=A[ia]>B[ib]?A[ia--]:B[ib--];
}
while(ia>=0)A[icur--]=A[ia--];
while(ib>=0)A[icur--]=B[ib--];
}
};
https://leetcode-cn.com/problems/merge-sorted-array/
链接：https://leetcode.com/problems/merge-sorted-array/descr...
https://leetcode-cn.com/problems/merge-sorted-array/ （图片来...
题目链接：https://leetcode-cn.com/problems/merge-sorted-array/...
题目来源：https://leetcode-cn.com/problems/merge-sorted-array/...
题目 https://leetcode-cn.com/problems/merge-sorted-array/ 给...
https://leetcode-cn.com/problems/merge-sorted-array/[http...
题目： https://leetcode-cn.com/problems/merge-sorted-array/d...
题目 https://www.lintcode.com/problem/merge-sorted-array/de...
本文标题：merge-sorted-array
本文链接：https://www.haomeiwen.com/subject/vifzqctx.html
网友评论