Cory lives in the computer
@coryn.bsky.social
620 followers
460 following
320 posts
Small town Software Engineer #100Devs | IT Support 👨💻 | Want to connect with people in #Tech | Certified silly goose | Beekeeping age | Anime enthusiast 💥 | music maker 🎹 | Proud Cat Dad 🐈
https://linktr.ee/webdevcory
https://github.com/ForLoopNelson
Posts
Media
Videos
Starter Packs
Pinned
![JavaScript code with comments. Text is as follows:
/*A fine answer but doesn't adhere to leetcode's rules */
const merge = function(nums1, m, nums2, n) {
let arr1 = nums1.splice(0,m)
let arr2 = nums2.splice(0,n)
return arr1.concat(arr2).toSorted()
};
/*You are given two integer arrays nums1 and nums2, sorted in non-decreasing order, and two integers m and n, representing the number of elements in nums1 and nums2 respectively.
Merge nums1 and nums2 into a single array sorted in non-decreasing order.
The final sorted array should not be returned by the function, but instead be stored inside the array nums1. To accommodate this, nums1 has a length of m + n, where the first m elements denote the elements that should be merged, and the last n elements are set to 0 and should be ignored. nums2 has a length of n. */
const mergeLeet = function(nums1, m, nums2, n) {
let i = m - 1;
let j = n - 1;
let k = m + n - 1;
while (j >= 0) {
if (i >= 0 && nums1[i] > nums2[j]) {
nums1[k--] = nums1[i--];
} else {
nums1[k--] = nums2[j--];
}
}
};
console.log(merge([1,2,3,0,0,0],3,[2,5,6],3)) //[1,2,2,3,5,6]
console.log(mergeLeet([1,2,3,0,0,0],3,[2,5,6],3)) //[1,2,2,3,5,6]
// Photo by Guillaume de Germain on Unsplash](https://cdn.bsky.app/img/feed_thumbnail/plain/did:plc:elwt26habreytri5wmg2tgir/bafkreihab3p3uh43gcklk4n7uprzvmoqv54kulcw3xz7uvtsydmudkqaj4@jpeg)
Reposted by Cory lives in the computer
