题目
给你一个链表的头节点 head
和一个整数 val
,请你删除链表中所有满足 Node.val == val
的节点,并返回 新的头节点 。
示例 1:
输入:head = [1,2,6,3,4,5,6], val = 6
输出:[1,2,3,4,5]
示例 2:
输入:head = [], val = 1
输出:[]
示例 3:
输入:head = [7,7,7,7], val = 7
输出:[]
提示:
- 列表中的节点在范围
[0, 104]
内 1 <= Node.val <= 50
0 <= k <= 50
解法
思路一: 设置新的虚拟节点。
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode() {}
* ListNode(int val) { this.val = val; }
* ListNode(int val, ListNode next) { this.val = val; this.next = next; }
* }
*/
class Solution {
public ListNode removeElements(ListNode head, int val) {
if(head == null){
return null;
}
ListNode newHead = new ListNode(-1);
ListNode tmp = newHead;
while(head != null){
int headValue = head.val;
if(headValue == val){
head = head.next;
continue;
}
tmp.next = new ListNode(headValue);
tmp = tmp.next;
head = head.next;
}
return newHead.next;
}
}
思路二: 递归。
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode() {}
* ListNode(int val) { this.val = val; }
* ListNode(int val, ListNode next) { this.val = val; this.next = next; }
* }
*/
class Solution {
// 递归
public ListNode removeElements(ListNode head, int val) {
if(head == null){
return null;
}
head.next = removeElements(head.next,val);
return head.val == val ? head.next : head;
}
}
思路三: 哨兵节点,在原链表上面操作。
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode() {}
* ListNode(int val) { this.val = val; }
* ListNode(int val, ListNode next) { this.val = val; this.next = next; }
* }
*/
class Solution {
// 在原链表上面操作,哨兵节点
public ListNode removeElements(ListNode head, int val) {
if(head == null){
return null;
}
ListNode newHead = new ListNode(-1);
newHead.next = head;
ListNode prev = newHead , curr = head;
while(curr != null){
if(curr.val == val){
prev.next = curr.next;
} else {
prev = curr;
}
curr = curr.next;
}
return newHead.next;
}
}
总结
本篇文章讲解了算法题目的思路和解法,代码和笔记由于纯手打,难免会有纰漏,如果发现错误的地方,请第一时间告诉我,这将是我进步的一个很重要的环节。以后会定期更新算法题目以及各种开发知识点,如果您觉得写得不错,不妨点个关注,谢谢。