LeetCode:Merge Sorted Array
2016-05-19 10:14
417 查看
Merge Sorted Array
Total Accepted: 100957 TotalSubmissions: 335044 Difficulty: Easy
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.
Subscribe to see which companies asked this question
Hide Tags
Array Two
Pointers
Hide Similar Problems
(E) Merge Two Sorted Lists
c++ code:
class Solution {
public:
void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
if (0 == n) return;
if (0 == m)
for (int i = 0; i<n; i++) nums1[i] = nums2[i];
int k = m + n - 1;
int i = m - 1, j = n - 1;
while (i>=0 && j>=0)
{
if (nums1[i]>nums2[j]) nums1[k--] = nums1[i--];
else nums1[k--] = nums2[j--];
}
while (j >= 0) nums1[k--] = nums2[j--];
}
};
相关文章推荐
- Django中静态文件设置方法
- 关于Ubuntu 系统 常用操作命令以备不时之需~~
- iOS 开发- 键盘类型
- GoAhead2.5源代码分析之1-用户管理(um.c)
- Net::FTP
- vim使用(持续更新)
- LeetCode 035: Search Insert Position
- index.html
- 【编程素质】混乱的思维逻辑
- Oracle中select使用别名
- 在Mac mini上编译Android源码
- iOS应用架构谈 view层的组织和调用方案
- 最近一段时间个人的一点想法
- 父级页面动态适应iframe高度变化
- JVM类加载器加载过程
- [Q&A]yum报错‘database disk image is malformed’
- Unity3d热更新全书-资源加载(一):从AssetBundle说起
- LeetCode:Merge Two Sorted Lists
- 快速均值滤波器的原理
- LDAP报错以及解决方法