问leetcode上一题Merge Sorted Array# JobHunting - 待字闺中
f*4
1 楼
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.
Note里说，A有额外空间,用来合并。
但我觉得必须额外开一个m的空间，除了A[m+n]外，放一些需要swap的变量。
这题最小的空间复杂度能到多少？
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.
Note里说，A有额外空间,用来合并。
但我觉得必须额外开一个m的空间，除了A[m+n]外，放一些需要swap的变量。
这题最小的空间复杂度能到多少？
