本文共 1545 字，大约阅读时间需要 5 分钟。

Easy

9412471FavoriteShare

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 = 3nums2 = [2,5,6],       n = 3Output: [1,2,2,3,5,6]

C++:

/* @Date    : 2018-01-26 09:29:27 @Author  : 酸饺子 (changzheng300@foxmail.com) @Link    : https://github.com/SourDumplings @Version : $Id$*//*https://leetcode.com/problems/palindrome-number/description/ */class Solution{public:    bool isPalindrome(int x)    {        if (x < 0)            return false;        char temp_s[100];        sprintf(temp_s, "%d", x);        int l = strlen(temp_s);        for (int i = 0, j = l - 1; i <= j; ++i, --j)        {            if (temp_s[i] != temp_s[j])                return false;        }        return true;    }};

 Java:

/** * @Date    : 2019-02-22 22:10:22 * @Author  : 酸饺子 (changzheng300@foxmail.com) * @Link    : https://github.com/SourDumplings * @Version : $Id$ * * https://leetcode.com/problems/merge-sorted-array/*/class Solution{    public void merge(int[] nums1, int m, int[] nums2, int n)    {        int j = m - 1, k = n - 1;        for (int i = m + n - 1; i > -1; --i)        {            if (k < 0 || j > -1 && nums1[j] > nums2[k])            {                nums1[i] = nums1[j--];            }            else                nums1[i] = nums2[k--];        }    }}

转载地址：http://hfrpi.baihongyu.com/