描述
输入两个递增的链表,单个链表的长度为n,合并这两个链表并使新链表中的节点仍然是递增排序的。
数据范围: 0 \le n \le 10000≤n≤1000,-1000 \le 节点值 \le 1000−1000≤节点值≤1000
要求:空间复杂度 O(1)O(1),时间复杂度 O(n)O(n)
如输入{1,3,5},{2,4,6}时,合并后的链表为{1,2,3,4,5,6},所以对应的输出为{1,2,3,4,5,6},转换过程如下图所示:
或输入{-1,2,4},{1,3,4}时,合并后的链表为{-1,1,2,3,4,4},所以对应的输出为{-1,1,2,3,4,4},转换过程如下图所示:
示例1
输入:
{1,3,5},{2,4,6}
复制
返回值:
{1,2,3,4,5,6}
结果
function ListNode(x){
this.val = x;
this.next = null;
}
function Merge(pHead1, pHead2)
{
// write code here
if(!pHead1 && !pHead2) return pHead1;
let arr1 = [];
let arr2 = [];
let next1 = pHead1;
let next2 = pHead2;
while(next1 || next2){
if(next1.val){
arr1.push(next1.val);
next1 = next1.next;
}
if(next2.val){
arr2.push(next2.val);
next2 = next2.next;
}
}
let arrAll = [...arr1, ...arr2];
arrAll = arrAll.sort((a, b)=> a - b);
let obj = new ListNode(arrAll[0]);
let obj2 = obj;
for(let i = 1;i < arrAll.length; i++){
obj.next = new ListNode(arrAll[i]);
obj = obj.next;
}
return obj2;
}
module.exports = {
Merge : Merge
};
这把终于把ListNode函数用起来了,朝着正确的方向迈进;
来自牛客编程题 https://www.nowcoder.com/exam/oj