[英]merge sorted array problem leetcode problem please help me with this code I have mentioned my piece of code and image of my input vs required output
var merge = function(nums1, m, nums2, n) { var 合并 = 函数(nums1,m,nums2,n){
let first = m-1;让第一个 = m-1;
for(let i = n-1; i>=0;i-- )
{
if(nums1[first]>nums2[i])
{
nums1.splice[first,0,nums2[i]]
}
else{
nums1.splice(first+1,0,nums2[i])
}
}
nums1.splice(m+n-1)
}; }; [enter image description here][1] [在此处输入图片说明][1]
[1]: https://i.stack.imgur.com/r2jAC.png**strong text** [1]: https : //i.stack.imgur.com/r2jAC.png**强文本**
声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.