88. Merge Sorted Array
2017-01-07 20:31
176 查看
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 nums1 and nums2 are m and n respectively.Subscribe to see which companies asked this question
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 nums1 and nums2 are m and n respectively.Subscribe to see which companies asked this question
public class Solution { public void merge(int[] nums1, int m, int[] nums2, int n) { int i=m-1; int j=n-1; int index=m+n-1; while(i>=0&&j>=0){ nums1[index--]=nums1[i]>nums2[j]?nums1[i--]:nums2[j--]; } while(j>=0){ nums1[index]=nums2[j]; j--; index--; } return ; } }
相关文章推荐
- 88. Merge Sorted Array
- 88. Merge Sorted Array
- 88. Merge Sorted Array
- Leetcode88. Merge Sorted Array
- 88. Merge Sorted Array
- leetcode题解-88. Merge Sorted Array
- Leetcode: 88. Merge Sorted Array
- 88. Merge Sorted Array
- LeetCode | 88. Merge Sorted Array
- leetcode 88. Merge Sorted Array
- Leetcode 88. Merge Sorted Array
- LeetCode 88. Merge Sorted Array
- Easy-题目39:88. Merge Sorted Array
- Leetcode 88. Merge Sorted Array (Easy) (cpp)
- 88. Merge Sorted Array
- 88. Merge Sorted Array
- Leetcode 88. Merge Sorted Array
- 88. Merge Sorted Array
- leetcode --88. Merge Sorted Array
- [leetcode]88. Merge Sorted Array[facebook](9)