【Leetcode】Merge Sorted Array

题目链接：https://leetcode.com/problems/merge-sorted-array/

题目：

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 nums1and nums2 are m and n respectively.

思路：

直接做就好了easy

算法：

	public void merge(int[] nums1, int m, int[] nums2, int n) {
		int i = 0, j = 0, k = 0;
		int nums3[] = new int[m + n];
		while (i < m && j < n) {
			if (nums1[i] > nums2[j]) {
				nums3[k] = nums2[j];
				j++;
			} else {
				nums3[k] = nums1[i];
				i++;
			}
			k++;
		}
		if (i == m) {
			for (int ii = j; ii < n; ii++, k++)
				nums3[k] = nums2[ii];
		}
		if (j == n) {
			for (int ii = i; ii < m; ii++, k++)
				nums3[k] = nums1[ii];
		}
		for (int ii = 0; ii < m + n; ii++) {//将数组3拷贝到数组1
			nums1[ii] = nums3[ii];
		}
	}