Merge Sorted Array
来源:互联网 发布:grub安装ubuntu 编辑:程序博客网 时间:2024/06/05 23:41
https://oj.leetcode.com/problems/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.
public void merge(int A[], int m, int B[], int n)
这题又是一个休闲题,从后往前merge就好。直接放代码吧
public void merge(int A[], int m, int B[], int n) { for(int i = m + n - 1, j = m - 1, k = n - 1; i >= 0; i--){ if(k < 0 || (j >= 0 && A[j] >= B[k])){ A[i] = A[j]; j--; }else{ A[i] = B[k]; k--; } } }
0 0
- [Array]Merge Sorted Array
- LeetCode: Merge Sorted Array
- Merge Sorted Array
- [Leetcode] Merge Sorted Array
- Merge Sorted Array
- [LeetCode] Merge Sorted Array
- Merge Sorted Array
- Merge Sorted Array
- [88]Merge Sorted Array
- Merge Sorted Array
- Merge Sorted Array
- [LeetCode]Merge Sorted Array
- Merge Sorted Array
- [leetcode]Merge Sorted Array
- Merge Sorted Array
- [Leetcode]Merge Sorted Array
- Merge Sorted Array
- Merge Sorted Array
- oracle安装
- Leetcode NO.59 Spiral Matrix II
- 学习计算机图形学OpenGL绘图
- Leetcode NO.27 Remove Element
- 一款好用的文件比较工具Meld
- Merge Sorted Array
- Gray Code
- mysql table is read only 解决
- Selenium
- CSDN我的收藏夹链接
- OGC
- [BZOJ 3680]吊打XXX(广义费马点、模拟退火搜索)
- 内核编译选项20要20不要
- Your content must have a ListView whose id attribute is 'android.R.id.list'