203. 移除链表元素
给你一个链表的头节点 head 和一个整数 val ,请你删除链表中所有满足 Node.val == val 的节点,并返回 新的头节点 。
输入: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 <= val <= 50
class Solution {
public static void main(String[] args) {
ListNode head = new ListNode();
ListNode h1 = new ListNode(1);
ListNode h2 = new ListNode(2);
ListNode h3 = new ListNode(6);
ListNode h4 = new ListNode(4);
ListNode h5 = new ListNode(5);
ListNode h6 = new ListNode(6);
head.next = h1;
h1.next = h2;
h2.next = h3;
h3.next = h4;
h4.next = h5;
h5.next = h6;
h6.next = null;
ListNode ints = new Solution().removeElements(head,6);
}
public ListNode removeElements(ListNode head, int val) {
// 循环解决头结点值为val的问题
while (head!=null && head.val == val){
head = head.next;
}
// 如果链表为空,那么就直接把头结点返回
if (head == null){
return head;
}
ListNode temp = head;
while (temp.next != null){
if (temp.next.val == val){
temp.next = temp.next.next;
}else {
temp = temp.next;
}
}
return head;
}
}
class ListNode{
int val;
ListNode next;
ListNode(){}
ListNode(int val){
this.val = val;
}
ListNode(int val, ListNode next){
this.val = val;
this.next = next;
}
}