标签：遍历数组 addition san spec into ott 组合 数组 int
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.
有两个数组，数组1前面部分是有用的数据，后面都为0，要把数组2的数组合并到数组1里面。
因为数组1前面部分保存有用的数据，需要反方向遍历数组
public class Solution {public void Merge(int[] nums1, int m, int[] nums2, int n) {int index = nums1.Length - 1;int index1 = m - 1;int index2 = n - 1;while (index1 >= 0 && index2 >= 0){if (nums1[index1] > nums2[index2]){nums1[index] = nums1[index1];index--;index1--;}else{nums1[index] = nums2[index2];index--;index2--;}}while (index1 >= 0){nums1[index--] = nums1[index1--];}while (index2 >= 0){nums1[index--] = nums2[index2--];}}}
88. 合并两个已排序的数组 Merge Sorted Array
标签：遍历数组 addition san spec into ott 组合 数组 int
原文地址：http://www.cnblogs.com/xiejunzhao/p/dd0b0d9445690233c37bef351403b0d4.html
