LeetCode - Merge Sorted Array
2015-04-11 23:04
423 查看
Description:
Given two sorted integer arrays A and B, merge B into A as one sorted array.
Note: You may assume that A has enough space (size that is greater or equal to m + n) to hold additional elements from B. The number of elements initialized in A and B are m and n respectively.
两个有序数组和成一个数组。
Given two sorted integer arrays A and B, merge B into A as one sorted array.
Note: You may assume that A has enough space (size that is greater or equal to m + n) to hold additional elements from B. The number of elements initialized in A and B are m and n respectively.
两个有序数组和成一个数组。
public class Solution { public void merge(int A[], int m, int B[], int n) { int[] storage = new int[m+n]; for(int i=0,j=0,cnt=0; cnt<m+n; i++,j++) { if(i<m) { storage[cnt++] = A[i]; } if(j<n) { storage[cnt++] = B[j]; } } Arrays.sort(storage); int j = 0; for(int i : storage) { A[j++] = i; } } }
相关文章推荐
- 【LeetCode】Merge Sorted Array 解题报告
- LeetCode题解——Merge Sorted Array
- Merge Sorted Array <leetcode>
- LeetCode刷题【Array】Merge Sorted Array
- LeetCode(88) Merge Sorted Array
- 开始刷题leetcode day3:Merge Sorted Array
- leetcode Merge Sorted Array
- [LeetCode]Merge Sorted Array(合并两个有序的数组)
- [LeetCode]Merge Sorted Array
- 【LEETCODE】88-Merge Sorted Array
- LeetCode No.88 Merge Sorted Array
- [LeetCode] 054: Merge Sorted Array
- Leetcode解题笔记-Merge sorted Array
- Leetcode Merge Sorted Array
- leetcode88:Merge Sorted Array
- leetcode: Merge Sorted Array O(n)解法
- LeetCode-Merge Sorted Array-合并有序表-归并排序
- 【LeetCode】88 - Merge Sorted Array
- LeetCode Online Judge 题目C# 练习 - Merge Sorted Array
- leetcode — merge-sorted-array