[LeetCode]88 Merge Sorted Array
来源:互联网 发布:java对象数组转json 编辑:程序博客网 时间:2024/05/21 18:37
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.
3 line Java Solution
public void merge(int A[], int m, int B[], int n) { int i=m-1, j=n-1, k=m+n-1; while (i>-1 && j>-1) A[k--]= (A[i]>B[j]) ? A[i--] : B[j--]; while (j>-1) A[k--]=B[j--];}
4ms C++ solution with single loop
This code relies on the simple observation that once all of the numbers from nums2
have been merged into nums1
, the rest of the numbers in nums1
that were not moved are already in the correct place.
class Solution {public: void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) { int i = m - 1, j = n - 1, tar = m + n - 1; while (j >= 0) { nums1[tar--] = i >= 0 && nums1[i] > nums2[j] ? nums1[i--] : nums2[j--]; } }};
0 0
- 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
- 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
- 大型互联网网站架构心得之二:并、换
- vim快捷键
- 魔术常量,超全局变量
- 触摸屏(TP)乱跳原因总结
- Python List的赋值方法
- [LeetCode]88 Merge Sorted Array
- 大型互联网网站架构心得之一:分
- 写给Java开发者的Node.JS简介
- java进程cpu占用过高处理步骤
- layer插件问题
- 教育借力免费服务是否靠谱
- ROS: How to develop catkin packages from an IDE
- mysql删除重复记录语句的方法
- Android屏幕适配方案(上)