Merge Sorted Array

来源：互联网发布：金九银十数据编辑：程序博客网时间：2024/05/24 05:33

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 nums1and nums2 are m and n respectively.

从后往前遍历数组

public class Solution {    public void merge(int[] nums1, int m, int[] nums2, int n)     {        int k1=m-1,k2=n-1;        for(int i=m+n-1;i>=0;i--)        {            if(k1<0 )            {                nums1[i]=nums2[k2--];                continue;            }            if(k2<0)            {                nums1[i]=nums1[k1--];                continue;            }            if(nums1[k1]>nums2[k2])                nums1[i]=nums1[k1--];            else                nums1[i]=nums2[k2--];        }    }}

0 0

[Array]Merge Sorted Array
LeetCode: Merge Sorted Array
Merge Sorted Array
[Leetcode] Merge Sorted Array
Merge Sorted Array
[LeetCode] Merge Sorted Array
Merge Sorted Array
Merge Sorted Array
[88]Merge Sorted Array
Merge Sorted Array
Merge Sorted Array
[LeetCode]Merge Sorted Array
Merge Sorted Array
[leetcode]Merge Sorted Array
Merge Sorted Array
[Leetcode]Merge Sorted Array
Merge Sorted Array
Merge Sorted Array
树莓派上使用摄像头
json数据格式原生解析器
Direct3D基础概念和模型整理
注解学习
AlexNet简单理解&&CNN初步了解
Merge Sorted Array
2016.07.03砸题选讲(Worldwide_D)小结
LeakCanary源码分析第一讲
C++面试题（四）——智能指针的原理和实现
windows下搭建Ruby(基于eclipse的环境)开发环境
Android Studio 第三方插件配置与应用
Liunx命令
ThinkPHP3.2.3代码笔记 - 模板调用三种方式
C# LDAP认证登录类参考