88. Merge Sorted Array
来源:互联网 发布:网络推广文案范文 编辑:程序博客网 时间:2024/05/03 04:21
class Solution {public: void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) { /* for(int i=0;i<n+m-nums1.size();i++) { nums1.push_back(0); } */ for(int i=n+m-1;i>=0;i--) { if(m==0) { nums1[i]=nums2[n-1]; n--; } else if(n!=0&&nums1[m-1]<nums2[n-1]) { nums1[i]=nums2[n-1]; n--; } else { nums1[i]=nums1[m-1]; m--; } } }};
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
- 58. Length of Last Word
- 66. Plus One
- javascript处理日期
- 67. Add Binary
- 70. Climbing Stairs
- 88. Merge Sorted Array
- C#打开防火墙端口代码
- 94. Binary Tree Inorder Traversal
- 100. Same Tree
- 101. Symmetric Tree
- 104. Maximum Depth of Binary Tree(递归)
- BZOJ3729: Gty的游戏
- 安装boost
- 欧拉项目第14题 Longest Collatz sequence