88. Merge Sorted Array
来源:互联网 发布:零下九十度 知乎 编辑:程序博客网 时间:2024/06/01 16:18
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.
Subscribe to see which companies asked this question
public class Solution { public void merge(int[] nums1, int m, int[] nums2, int n) { int i=m-1; int j=n-1; int index=m+n-1; while(i>=0&&j>=0){ nums1[index--]=nums1[i]>nums2[j]?nums1[i--]:nums2[j--]; } while(j>=0){ nums1[index]=nums2[j]; j--; index--; } return ; }}
0 0
- 88. Merge Sorted Array
- 88.Merge Sorted Array
- 88. Merge Sorted Array
- 88. Merge Sorted Array
- 88. Merge Sorted Array
- 88. Merge Sorted Array
- 88. Merge Sorted Array
- 88. Merge Sorted Array
- 88. Merge Sorted Array
- 88. Merge Sorted Array
- 88. Merge Sorted Array
- 88. Merge Sorted Array
- 88. Merge Sorted Array
- 88. Merge Sorted Array
- 88. Merge Sorted Array
- 88. Merge Sorted Array
- 88. Merge Sorted Array
- 88. Merge Sorted Array
- MySQL:日期函数、时间函数总结(MySQL 5.X)
- 《剑指offer》面试题答案汇总(Java版)
- 栈解决括号匹配
- 机器学习算法——logistic回归
- SSM框架整合
- 88. Merge Sorted Array
- 《learning laravel》翻译第六章-----部署我们的Laravel应用
- h5 storage
- IP分配基础
- java面向对象中常见的异常类型
- HDOJ-5438-Ponds[拓扑排序动态删点]
- Java面经(后台开发)校招准备资料汇总
- leetcode25: Reverse Nodes in k-Group
- 数学的原来 这么深