题目描述:
Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.
Note:
The number of elements initialized in nums1 and nums2 are m and n respectively.You may assume that nums1 has enough space (size that is greater or equal to m + n) to hold additional elements from nums2.Example:
Input:
nums1 = [1,2,3,0,0,0], m = 3
nums2 = [2,5,6], n = 3
Output: [1,2,2,3,5,6]
题目解释:
给出两个排序好的整形数组num1和num2,将num2合并到num1中使得它仍旧有序。
The number of elements initialized in
nums1 and
nums2 are
m and
n respectively.You may assume that
nums1 has enough space (size that is greater or equal to
m +
n) to hold additional elements from
nums2.
题目解法:
1.我的解法:先将nums2放到nums1中,然后直接选择排序(当然也可以选择冒泡,这个方法好像不能快徘),代码如下:
class Solution {
public void merge(int[] nums1, int m, int[] nums2, int n) {
for(int i = 0; i < n ;i++){
nums1[m+i] = nums2[i];
}
int index;
for(int i = 0;i<nums1.length;i++) {
index = i;
for(int j = i+1;j<nums1.length;j++) {
if(nums1[j] < nums1[index]) {
index = j;
}
}
if(index != i) {
int temp = nums1[i];
nums1[i] = nums1[index];
nums1[index] = temp;
}
}
}
}