【LeetCode】88. Merge Sorted Array
来源:互联网 发布:淘宝网创业计划书 编辑:程序博客网 时间:2024/06/05 18:49
Description:
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.
题目要求:合并排序两个有序的整数数组。(已提供足够空间)
Solutions:
class Solution {
public:
void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
int i,j;
i=m-1;
j=n-1;
while(i>=0&&j>=0){
if(nums1[i]>nums2[j]){
nums1[i+j+1]=nums1[i];
i--;
}
else{
nums1[i+j+1]=nums2[j];
j--;
}
}
while(i<0&&j>=0){
nums1[i+j+1]=nums2[j];
j--;
}
while(i<0&&j==0){
nums1[i+j+1]=nums1[i];
i--;
}
}
};
- LeetCode 88. Merge Sorted Array
- [LeetCode]88.Merge Sorted Array
- [Leetcode] 88. Merge Sorted Array
- LeetCode --- 88. Merge Sorted Array
- [leetcode] 88.Merge Sorted Array
- [leetcode] 88. Merge Sorted Array
- 88. Merge Sorted Array LeetCode
- 【LeetCode】88. Merge Sorted Array
- LeetCode *** 88. Merge Sorted Array
- LeetCode 88. Merge Sorted Array
- leetcode 88. Merge Sorted Array
- LeetCode 88. Merge Sorted Array
- leetcode-88. Merge Sorted Array
- leetcode 88. Merge Sorted Array
- Leetcode - 88. Merge Sorted Array
- LeetCode 88. Merge Sorted Array
- LeetCode-88.Merge Sorted Array
- Leetcode 88. Merge Sorted Array
- Volley(三)
- 5.2最少转机——图的广度优先遍历
- 归并排序(Java&&JavaScript)
- 牛客网剑指offer-02替换空格
- HTML5本地存储-localStorage如何实现定时存储
- 【LeetCode】88. Merge Sorted Array
- Dirichlet Process and Stick-Breaking(DP的Stick-breaking 构造)
- signed char类型取值范围计算
- 经典排序算法之选择排序算法
- 基于nodejs模拟浏览器post请求爬取json数据
- SLF4JLogFactory does not implement org.apache.commons.logging.LogFactory
- 【第十课】异常---finally的使用
- 6.1只有五行的算法——Floyd-Warshall
- 免安装版MySQL乱码(问号)问题解决方案