Easy 88题 Merge Sorted Array
来源:互联网 发布:飞行器动力知乎 编辑:程序博客网 时间:2024/05/17 17:55
Question:
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.
Solution:
public class Solution { public void merge(int[] nums1, int m, int[] nums2, int n) { //from back tothe front int index=m+n-1; int i=m-1; int j=n-1; while(i>=0&&j>=0) { nums1[index--]=nums1[i]>nums2[j]?nums1[i--]:nums2[j--]; } //如果剩下的是nums2还没有排完,需要一一对应回去 //如果剩下的是nums1还没有排完就不用排了。。。 while(j>=0) nums1[index--] = nums2[j--]; }}
0 0
- Easy 88题 Merge Sorted Array
- [Leetcode 88, Easy] Merge Sorted Array
- <LeetCode><Easy> 88 Merge Sorted Array
- LeetCode-88-Merge Sorted Array(归并)-Easy
- Easy 19 Merge Sorted Array(88)
- Leetcode OJ 88 Merge Sorted Array [Easy]
- leetcode 88[easy]---Merge Sorted Array
- Leetcode[Easy] - Merge Sorted Array
- Merge Sorted Array(easy)
- 【Easy】88. Merge Sorted Array
- Easy-题目39:88. Merge Sorted Array
- 88. Merge Sorted Array [easy] (Python)
- Leetcode 88. Merge Sorted Array (Easy) (cpp)
- 【leetcode】88. Merge Sorted Array (easy)
- LeetCode-Easy刷题(18) Merge Sorted Array
- [88]Merge Sorted Array
- 88 Merge Sorted Array
- 88 Merge Sorted Array
- MIT6.824 分布式系统 lab1
- 快速排序算法
- JavaScript 学习笔记 1
- 决策树(ID3)python
- Leetcode 43. Multiply Strings
- Easy 88题 Merge Sorted Array
- 方程求值
- Leetcode 200. Number of Islands & 305. Number of Islands II
- ArrayList容器---去除重复元素
- 搞笑
- GCC 6.2, significantly improved performance!
- Easy 219题 Contains Duplicate II
- sdmup
- 理解个KMP怎么这么难= =#