[LeetCode] Merge Sorted Array 解题思路
来源:互联网 发布:智能电视点歌软件 编辑:程序博客网 时间:2024/05/22 11:42
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.
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.
» Solve this problem
[解题思路]
从后往前填空。
[Code]
1: void merge(int A[], int m, int B[], int n) {
2: // Start typing your C/C++ solution below
3: // DO NOT write int main() function
4: int k = m+n-1;
5: int i = m-1, j =n-1;
6: for(; i>=0 && j>=0; k--)
7: {
8: if(A[i] >= B[j])
9: {
10: A[k] = A[i];
11: i--;
12: }
13: else
14: {
15: A[k] = B[j];
16: j--;
17: }
18: }
19: while(j >=0)
20: {
21: A[k] = B[j];
22: k--; j--;
23: }
24: }
0 0
- [LeetCode] Merge Sorted Array 解题思路
- [leetcode] 88. Merge Sorted Array 解题报告
- [Leetcode] 88. Merge Sorted Array 解题报告
- 【LeetCode】Merge Sorted Array 解题报告
- leetCode 88.Merge Sorted Array (合并排序数组) 解题思路和方法
- LeetCode - 88. Merge Sorted Array - 思路详解 - C++
- LeetCode: Merge Sorted Array
- [Leetcode] Merge Sorted Array
- [LeetCode] Merge Sorted Array
- [LeetCode]Merge Sorted Array
- [leetcode]Merge Sorted Array
- [Leetcode]Merge Sorted Array
- LeetCode-Merge Sorted Array
- [leetcode] Merge Sorted Array
- LeetCode - Merge Sorted Array
- [LeetCode] Merge Sorted Array
- LeetCode | Merge Sorted Array
- 【leetcode】Merge Sorted Array
- [LeetCode] Maximum Depth of Binary Tree
- [LeetCode] Maximum Subarray 解题报告
- Windows Server 2008 R2 With SP1简体中文版 + 破解补丁
- [LeetCode] Median of Two Sorted Arrays 解题报告
- [LeetCode] Merge k Sorted Lists 解题报告
- [LeetCode] Merge Sorted Array 解题思路
- 调用活动,通过intent显式调用
- du&df
- [LeetCode] Minimum Depth of Binary Tree
- [LeetCode] Minimum Path Sum 解题报告
- [LeetCode] Minimum Window Substring 解题报告
- [LeetCode] Multiply Strings 解题报告
- [LeetCode] Next Permutation 解题报告
- [LeetCode] Palindrome Number 解题报告