题目:
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 andn respectively.
思路:一开始只想到从前往后,这样需要很多多余的数组移动,由于最后A的大小一定为m+n,所以每次将最大的放在最后,依次向前,可以减少数组移动