LeetCode(088) Merge Sorted Array(Java)
2015-04-12 14:25
471 查看
题目如下:
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.
分析如下:
数组A: {11111.........}
数组B: {2222}
A' (A after merge) = A + B , 因为 A 在题目中保证了有足够多的空间。
必然按照index从大到小的顺序进行merge,才不会把A的元素给抹掉。
我的代码:
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.
分析如下:
数组A: {11111.........}
数组B: {2222}
A' (A after merge) = A + B , 因为 A 在题目中保证了有足够多的空间。
必然按照index从大到小的顺序进行merge,才不会把A的元素给抹掉。
我的代码:
//245ms public class Solution { public void merge(int A[], int m, int B[], int n) { int j = m - 1; int k = n - 1; for (int i = m + n - 1; i >=0; --i) { if (j >=0 && k >= 0) { if (A[j] > B[k]) { A[i] = A[j]; --j; } else { A[i] = B[k]; --k; } } else if (j >=0) { A[i] = A[j]; --j; } else if (k >=0) { A[i] = B[k]; --k; } } } }
相关文章推荐
- Java for LeetCode 088 Merge Sorted Array
- 【LeetCode-面试算法经典-Java实现】【088-Merge Sorted Array(合并排序数组)】
- LeetCode 088 Merge Sorted Array
- 088 Merge Sorted Array [Leetcode]
- Java [Leetcode 88]CMerge Sorted Array
- [Leetcode] Merge Sorted Array (Java)
- LeetCode – Merge Sorted Array (Java)
- leetcode_088 Merge Sorted Array
- Leetcode_c++: Merge Sorted Array (088)
- leetcode 088 —— Merge Sorted Array
- LeetCode 88 — Merge Sorted Array(C++ Java Python)
- LeetCode 088 Merge Sorted Array
- (java)leetcode-88:Merge Sorted Array
- LeetCode: Merge Sorted Array [088]
- Merge Sorted Array ---leetcode Java C#
- LeetCode|Merge Sorted Array -java
- [LeetCode][Java] Merge Sorted Array
- [LeetCode]题解(python):088-Merge Sorted Array
- leetcode:Merge Sorted Array 【Java】
- leetcode 088 Merge Sorted Array