René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/merge-sorted-array","name":"#88 - Merge Sorted Array - LeetCode JavaScript Solutions","description":"You are given two integer arrays `nums1` and `nums2`, sorted in non-decreasing order, and two integers `m` and `n`, representing the number ...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {number[]} nums1\n * @param {number} m\n * @param {number[]} nums2\n * @param {number} n\n * @return {void} Do not return anything, modify nums1 in-place instead.\n */\nvar merge = function(nums1, m, nums2, n) {\n let i = m + n - 1;\n\n m--;\n n--;\n\n while (n >= 0) {\n nums1[i--] = nums1[m] > nums2[n] ? nums1[m--] : nums2[n--];\n }\n};","keywords":"LeetCode 88, #88 - Merge Sorted Array, Easy, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}