leetcode题记:Merge Sorted Array

编程语言:JAVA

题目描述:

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]

提交反馈:

59 / 59 test cases passed.
Status: Accepted
Runtime: 4 ms
Submitted: 2 minutes ago
You are here! 
Your runtime beats 14.97 % of java submissions.

解题思路:

为了不占用额外空间,倒着比较。最大的放在最后。循环结束条件为其中一个数组比较完成。while循环控制多个条件。

代码:

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

        while(j >= 0){
            nums1[j] = nums2[j];
            j -= 1;
        }
    }
}
已标记关键词 清除标记
相关推荐
©️2020 CSDN 皮肤主题: 书香水墨 设计师:CSDN官方博客 返回首页