Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.
Note:
You may assume that nums1 has enough space (size that is greater or equal to m + n) to hold additional elements from nums2. The number of elements initialized in nums1 and nums2 are m and n respectively.
我的做法:
失败,且卡了很久,想着两个for循环嵌套nums1和nums2,然后用list.insert这个函数。
因为没有用纸写,以及各种corner case,各种失败。
solution:
用while来循环,然后根据nums1[m-1]和nums2[n-1]的大小关系,决定是m-=1还是n-=1,然后到最后,有一个n>0,m=0的对应操作。