| [ Web Proxy ] |
| Viewing: https://raw.githubusercontent.com/LjyYano/LeetCode/master/src/main/java/L0088_MergeSortedArray.java | [Back] [Original] |
/** * https://leetcode.cn/problems/merge-sorted-array/ * * nums1 nums2 m n nums1 nums2 * nums2 nums1 * * nums1 nums1 m + n m n 0 nums2 n * * 1 * nums1 = [1,2,3,0,0,0], m = 3, nums2 = [2,5,6], n = 3 * [1,2,2,3,5,6] * [1,2,3] [2,5,6] * [1,2,2,3,5,6] nums1 * * 2 * nums1 = [1], m = 1, nums2 = [], n = 0 * [1] * [1] [] * [1] * * 3 * nums1 = [0], m = 0, nums2 = [1], n = 1 * [1] * [] [1] * [1] * m = 0 nums1 nums1 0 nums1 * * * - nums1.length == m + n * - nums2.length == n * - 0
| Web Proxy Viewer | New URL | Original Page |