Merge Sorted Array

来源：互联网发布：nginx 多域名配置编辑：程序博客网时间：2024/05/21 09:22

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) {        if(m==0)          {              for(int k=0;k<n;k++)               nums1[k]=nums2[k];         }                  for(int i=0;i<n;i++)        {            int j=m-1+i;                       for(;j>=0;j--)            {                if(nums1[j]>nums2[i])                   nums1[j+1]=nums1[j];                                      else break;            }            nums1[j+1]=nums2[i];                   }    }}

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
leetcode | Letter Combinations of a Phone Number
App项目开发流程图解
hdu1009——FatMouse' Trade
黑马程序员----反射
C#程序开发中经常遇到的10条实用的代码
Merge Sorted Array
浅析POI在广告投放中的作用
iPhone屏幕知识点解析
MFC六大关键技术之仿真学习笔记（四）
IOS 6 自动布局入门－1
hdu1418——抱歉
创建基线或发行基线的主要步骤
井底之蛙的新发现LEMP
【转载】failed to create virtual machine