题目：删除链表的节点
给定单向链表的头指针和一个要删除的节点的值，定义一个函数删除该节点。
示例1
输入: head = [4,5,1,9], val = 5
输出: [4,1,9]
解释: 给定你链表中值为 5 的第二个节点，那么在调用了你的函数之后，该链表应变为 4 -> 1 -> 9.
示例2
输入: head = [4,5,1,9], val = 1
输出: [4,5,9]
解释: 给定你链表中值为 1 的第三个节点，那么在调用了你的函数之后，该链表应变为 4 -> 5 -> 9.
题解
递归
/**
* Definition for singly-linked list.
* function ListNode(val) {
* this.val = val;
* this.next = null;
* }
*/
/**
* @param {ListNode} head
* @param {number} val
* @return {ListNode}
*/
var deleteNode = function(head, val) {
if (head.val === val) return head.next;
head.next = deleteNode(head.next, val);
return head;
};
双指针
/**
* Definition for singly-linked list.
* function ListNode(val) {
* this.val = val;
* this.next = null;
* }
*/
/**
* @param {ListNode} head
* @param {number} val
* @return {ListNode}
*/
var deleteNode = function(head, val) {
if(head.val == val) return head.next;
let pre = head, cur = head.next;
while(cur) {
if (cur.val === val) {
pre.next = cur.next;
return head;
}
pre = cur;
cur = cur.next;
}
return head;
};
单指针
function deleteNode(head, val) {
if (head.val == val) return head.next;
let cur = head;
while (cur.next) {
if (cur.next.val == val) {
cur.next = cur.next.next;
return head;
}
cur = cur.next;
}
return head;
}
引用
- 剑指offer书籍
- 力扣题解
