88. Merge Sorted Array
2017-03-12 16:24
162 查看
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.
问题注意:题目中说Nums1的空间足够大,而传入的参数m,n分别为两个数组中待排序的数字个数
public void merge(int[] nums1, int m, int[] nums2, int n) {
if(n==0) return;
int k=m+n-1;
int i=m-1;
int j=n-1;
while(k>=0){
int a1=i>=0?nums1[i]:Integer.MIN_VALUE;
int a2=j>=0?nums2[j]:Integer.MIN_VALUE;
if(a2>=a1){
nums1[k]=nums2[j];
j--;
}else{
nums1[k]=nums1[i];
i--;
}
k--;
}
// for(int index=0;index<m+n;index++){
// System.out.print(nums1[index]+"\t");
// }
}
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.
问题注意:题目中说Nums1的空间足够大,而传入的参数m,n分别为两个数组中待排序的数字个数
public void merge(int[] nums1, int m, int[] nums2, int n) {
if(n==0) return;
int k=m+n-1;
int i=m-1;
int j=n-1;
while(k>=0){
int a1=i>=0?nums1[i]:Integer.MIN_VALUE;
int a2=j>=0?nums2[j]:Integer.MIN_VALUE;
if(a2>=a1){
nums1[k]=nums2[j];
j--;
}else{
nums1[k]=nums1[i];
i--;
}
k--;
}
// for(int index=0;index<m+n;index++){
// System.out.print(nums1[index]+"\t");
// }
}
相关文章推荐
- Leet Code OJ 88. Merge Sorted Array [Difficulty: Easy]
- Leetcode Everyday: 88. Merge Sorted Array
- 【leetcode】88. Merge Sorted Array
- [LeetCode] 88. Merge Sorted Array
- LeetCode 88. Merge Sorted Array
- 88. Merge Sorted Array
- 88. Merge Sorted Array
- [LeetCode] 88. Merge Sorted Array
- LeetCode-Easy部分中标签为Two Pointers 88. Merge Sorted Array
- LeetCode 88. Merge Sorted Array
- 88. Merge Sorted Array
- leetcode--88. Merge Sorted Array
- 【LeetCode】88. Merge Sorted Array (2 solutions)
- 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 (java)
- 88. Merge Sorted Array