LeetCode88 Merge Sorted Array

LeetCode88 Merge Sorted Array

問題來源LeetCode88

問題描述

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.

問題分析

這道題比較簡單，兩個已經排序好的數組，直接對比然後進行插入排序就好。

代碼如下

public void merge(int[] nums1, int m, int[] nums2, int n) {
    int all = m+n-1;
    m--;
    n--;
    while (m>=0||n>=0){
        if(n<0||(m>=0&&nums1[m]>=nums2[n])){
            nums1[all]=nums1[m];
            m--;
            all--;
            continue;
        }
        if(m<0||(n>=0&&nums1[m]<nums2[n])){
            nums1[all]=nums2[n];
            n--;
            all--;
            continue;
        }
    }
}

LeetCode學習筆記持續更新

GitHub地址 https://github.com/yanqinghe/leetcode

CSDN博客地址 http://blog.csdn.net/yanqinghe123/article/category/7176678