【LeetCode】88.Merge Sorted Array(easy)解题报告
2017-11-15 08:54
411 查看
【LeetCode】88.Merge Sorted Array(easy)解题报告
题目地址:https://leetcode.com/problems/merge-sorted-array/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.
两种思路,第一种merge sort,但是需要额外空间存储排序好的表。第二种如下,从后往前排序,避免覆盖,直接存到nums1上。
Solution:
Date:2017年11月15日
题目地址:https://leetcode.com/problems/merge-sorted-array/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.
两种思路,第一种merge sort,但是需要额外空间存储排序好的表。第二种如下,从后往前排序,避免覆盖,直接存到nums1上。
Solution:
class Solution { public void merge(int[] nums1, int m, int[] nums2, int n) { int index1 = m-1; int index2 = n-1; int index3 = m+n-1; while(index1>=0 && index2>=0){ if(nums1[index1]>=nums2[index2]){ nums1[index3--] = nums1[index1--]; }else{ nums1[index3--] = nums2[index2--]; } } while(index2>=0){ nums1[index3--] = nums2[index2--]; } } }
Date:2017年11月15日
相关文章推荐
- LeetCode解题报告 102. Binary Tree Level Order Traversal [easy]
- 【LeetCode】108.Convert Sorted Array to Binary Search Tree(Easy)解题报告
- 【LeetCode】217.Contains Duplicate(Easy)解题报告
- 【LeetCode】455.Assign Cookies(Easy)解题报告
- 【LeetCode】572.Subtree of Another Tree(Easy)解题报告
- LeetCode解题报告 112. Path Sum [easy]
- 【LeetCode】599.Minimum Index Sum of Two Lists(Easy)解题报告
- 【LeetCode】27.Remove Element(Easy)解题报告
- LeetCode解题报告 455. Assign Cookies [easy]
- LeetCode解题报告 169. Majority Element [easy]
- 【LeetCode】160.Intersection of Two Linked Lists(Easy)解题报告
- 【LeetCode】26.Remove Duplicates from Sorted Array(Easy)解题报告
- 【LeetCode】401.Binary Watch(easy)解题报告
- 【LeetCode】53.Maximum Subarray(Easy)解题报告
- 【LeetCode】118.Pascal's Triangle(easy)解题报告
- LeetCode解题报告 349. Intersection of Two Arrays [easy]
- LeetCode解题报告 107. Binary Tree Level Order Traversal II [easy]
- 【LeetCode】653.Two Sum IV - Input is a BST(Easy)解题报告
- 【LeetCode】463.Island Perimeter(easy)解题报告
- 【LeetCode】412.Fizz Buzz(easy)解题报告