Merge Sorted Array:归并有序数组
来源:互联网 发布:脂老虎饼干 知乎 编辑:程序博客网 时间:2024/05/20 04:30
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.
class Solution { public void merge(int[] nums1, int m, int[] nums2, int n) { int a = 0;//for m int b = 0;//for n int in = 0; while(a<(m+in)&&b<n){ if(nums1[a]<nums2[b]){ a++; }else{ for(int i = m + in;i>a;i--){ nums1[i] = nums1[i-1]; } nums1[a] = nums2[b]; a++; b++; in++; } } if(b<n){ for(int i = b;b<n;b++){ nums1[a] = nums2[b]; a++; } } }}
或:
public void merge(int A[], int m, int B[], int n) { int i=m-1, j=n-1, k=m+n-1; while (i>-1 && j>-1) A[k--]= (A[i]>B[j]) ? A[i--] : B[j--]; while (j>-1) A[k--]=B[j--];}
阅读全文
0 0
- Merge Sorted Array:归并有序数组
- LeetCode | Merge Sorted Array(归并有序数组)
- 【数组&归并】Merge Sorted Array
- ※ Leetcode - Array - 88. Merge Sorted Array(快速归并两个有序数组)
- Merge Sorted Array 合并两个有序数组
- Merge Sorted Array -- 合并两个有序数组
- Merge Sorted Array合并两个有序数组
- leetcode88---Merge Sorted Array(合并有序数组)
- leetcode Merge Sorted Array 合并有序数组
- Merge Sorted Array 混合插入有序数组
- 88. Merge Sorted Array 合并有序数组
- 原地归并数组 Merge Sorted Array
- [LeetCode] Merge Sorted Array 归并排序数组
- Merge Sorted Array 归并2个数组
- (LeetCode)Merge Sorted Array --- 归并数组
- Merge Sorted Array 合并两个有序数组 @LeetCode
- 【LeetCode】- Merge Sorted Array (合并有序数组).
- (每日算法)LeetCode -- Merge Sorted Array (合并有序数组)
- 写给小白看的 JavaScript 异步
- 2017-11-22 6周3次课 正则------awk
- SQL优化
- springcloud(九):配置中心和消息总线(配置中心终结版)
- win10+Anaconda5.0.1 python3.6 编译caffe的坑
- Merge Sorted Array:归并有序数组
- DotNetCore.2.0.0 asp.net项目部署报错HTTP 错误 500.19
- leetcode: 99. Recover Binary Search Tree
- springcloud(十):服务网关zuul
- 学习CMake,先保存下
- 进阶丨如何让你的数据分析更加简洁专业
- 获取到HTML里面的值
- 腾讯2017秋招笔试编程题:游戏任务标记 [python]
- leetcode: 100. Same Tree