LeetCode 0088 - Merge Sorted Array
# Hints
- 双指针扫描
# 题面
Difficulty | Time Complexity Limit | Extra-Memory Complexity Limit |
---|---|---|
Easy |
Given two sorted integer arrays nums1
and nums2
, merge nums2
into nums1
as one sorted array.
Note:
The number of elements initialized in
nums1
andnums2
are and respectively.You may assume that
nums1
has enough space (size that is equal to ) to hold additional elements fromnums2
.
Example:
Input:
nums1 = [1,2,3,0,0,0], m = 3
nums2 = [2,5,6], n = 3
Output: [1,2,2,3,5,6]
Constraints:
# 题意
给定两个长为 和 的升序排序的数组 nums1
和 nums2
,要求将 nums2
中的元素合并到 nums1
中,并维持 nums1
的升序性质不变。
# 题解
水题,我们从 和 开始倒序遍历,每次取较大者放入 的尾部即可。
# AC代码
class Solution {
public:
void merge(vector<int> & nums1, int m, vector<int> & nums2, int n) {
// 遍历
int i = m - 1, j = n - 1, k = m + n - 1;
while (i >= 0 && j >= 0) {
if (nums1[i] > nums2[j]) {
nums1[k] = nums1[i];
i --;
} else {
nums1[k] = nums2[j];
j --;
}
k --;
}
while (i >= 0) {
nums1[k] = nums1[i];
i --;
k --;
}
while (j >= 0) {
nums1[k] = nums2[j];
j --;
k --;
}
}
};
- 01
- Reading Papers - Kernel Concurrency06-01
- 02
- Linux Kernel - Source Code Overview05-01
- 03
- Linux Kernel - Per-CPU Storage05-01