Merge Sorted Array
2014-02-01 02:53
197 查看
Merge Sorted Array
Total Accepted: 6782 TotalSubmissions: 21148My Submissions
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 to hold additional elements from B. The number of elements initialized in A and B are m and n respectively.
public static void merge2(int[] A, int m, int[] B, int n) {
int i = m + n - 1;
m--;n--;
while (m >= 0 && n >= 0) A[i--] = A[m] > B
? A[m--] : B[n--];
while (n >= 0) A[i--] = B[n--];
}
或者:
public static void merge(int[] A, int m, int[] B, int n) {
System.arraycopy(A, 0, A, n, m);
int a = n, b = 0, i = 0;
while (a < m + n && b < n) A[i++] = A[a] <= B[b] ? A[a++] : B[b++];
while (b < n) A[i++] = B[b++];
}
相关文章推荐
- LeetCode——Merge Sorted Array
- [LeetCode]Merge Sorted Array
- leetcode 088 —— Merge Sorted Array
- leetcode---Merge Sorted Array
- (lleetcode)Merge Sorted Array
- leetcode 88 Merge Sorted Array
- [LeetCode] Merge Sorted Array
- 88. Merge Sorted Array
- LeetCode:Merge Sorted Array
- [Leetcode]#88 Merge Sorted Array
- 88. Merge Sorted Array
- Merge Sorted Array
- Merge Two & k Sorted Lists & Merge Sorted Array
- [LeetCode] Merge Sorted Array 合并两个有序数组
- LeetCode88 Merge Sorted Array 解题报告
- LeetCode: Merge Sorted Array
- [leetcode][88] Merge Sorted Array
- "Contains Duplicate II" and "Merge Sorted Array"
- [LeetCode] Merge Sorted Array
- [LeetCode] Merge Sorted Array 解题思路