【题解】【数组】【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 to hold additional elements from B. The number of elements initialized in A and B are m and n respectively.
思路:
归并的一部分,比Merge Two Sorted Lists还要简单
代码:
1 void merge(int A[], int m, int B[], int n) { 2 int i = m-1; 3 int j = n-1; 4 int t = m+n-1;//t不能定义在for循环内,否则最后无法访问 5 while(t>=0 && i>=0 && j>=0){ 6 if(A[i] > B[j]) A[t--] = A[i--]; 7 else A[t--] = B[j--]; 8 } 9 while(j >= 0) A[t--] = B[j--]; 10 }
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】博客园社区专享云产品让利特惠,阿里云新客6.5折上折
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步