[leetcode]Merge Sorted Array
2014-10-27 21:19
351 查看
问题描述:
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 Merge_Sorted_Array { //java public void merge(int A[], int m, int B[], int n) { int [] C = new int [m+n]; int i=0, j=0, k=0; while(i<m && j<n){ if(A[i] > B[j]) C[k++] = B[j++]; else C[k++] = A[i++]; } if(i == m) while(j<n) C[k++] = B[j++]; else while(i<m) C[k++] = A[i++]; for(i=0; i<m+n; i++) A[i] = C[i]; } }
相关文章推荐
- leetcode | Merge Sorted Array
- LeetCode Merge Sorted Array(合并有序数组)
- [Leetcode]-Merge Sorted Array
- LeetCode - Merge Sorted Array
- leetcode 88: Merge Sorted Array
- leetcode:88 Merge Sorted Array-每日编程第三十一题
- [LeetCode]Merge Sorted Array
- leetcode_Merge Sorted Array
- LeetCode——Merge Sorted Array
- LeetCode Merge Sorted Array
- Leetcode: Merge Sorted Array
- [leetcode-88]Merge Sorted Array(C语言)
- LeetCode Merge Sorted Array
- 【LeetCode】88_Merge Sorted Array
- LeetCode(40)-Merge Sorted Array
- [C语言][LeetCode][88]Merge Sorted Array
- leetcode之Merge Sorted Array
- Leetcode-Merge Sorted Array
- Leetcode: Merge Sorted Array
- Merge Sorted Array [LeetCode]