# Merge Sorted Array

Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.

Note:
You may assume that nums1 has enough space (size that is greater or equal to m + n) to hold additional elements from nums2. The number of elements initialized in nums1and nums2 are m and n respectively.

public class Solution {
public void merge(int[] nums1, int m, int[] nums2, int n) {
while (m > 0 && n > 0) {
if (nums1[m-1] > nums2[n-1]) {
nums1[m+n-1] = nums1[m-1];
m--;
} else {
nums1[m+n-1] = nums2[n-1];
n--;
}
}
while (n > 0) {
nums1[m+n-1] = nums2[n-1];
n--;
}
}
}

Merge Sorted Array

• 0

开心

• 0

板砖

• 0

感动

• 0

有用

• 0

疑问

• 0

难过

• 0

无聊

• 0

震惊

Given two sorted integer arrays A and B, merge B into A as one sorted array. Note: You may as
Given two sorted integer arrays A and B, merge B into A as one sorted array. Note: You may as
Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.

1 void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) 2 { 3 int i =
Merge k sorted linked lists and return it as one sorted list. Analyze and describe its comple
Merge two sorted linked lists and return it as a new list. The new list should be made by spl
Suppose a sorted array is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6
Question: Suppose a sorted array is rotated at some pivot unknown to you beforehand. (i.e., 0
【题目】 Given two sorted integer arrays A and B, merge B into A as one sorted array. Note: Y