题目:
删除链表中等于给定值 val 的所有节点。
示例:
输入: 1->2->6->3->4->5->6, val = 6
输出: 1->2->3->4->5
对链表熟悉的话,这道题相对简单一些。
代码(下面是解题的三种方法):
题目地址:https://leetcode-cn.com/problems/remove-linked-list-elements/description/
//在leetcode提交时候无需提交这个类
public class ListNode {
public int val;
public ListNode next;
public ListNode(int x) {
val = x;
}
}
方法一:
class Solution {
public ListNode removeElements(ListNode head, int val) {
while(head != null && head.val == val)
head = head.next;
if(head == null)
return head;
ListNode prev = head;
while(prev.next != null){
if(prev.next.val == val)
prev.next = prev.next.next;
else
prev = prev.next;
}
return head;
}
}
方法二(使用虚拟头结点):
class Solution{
public ListNode removeElements(ListNode head, int val) {
ListNode dummyHead = new ListNode(-1);
dummyHead.next = head;
ListNode prev = dummyHead;
while(prev.next != null){
if(prev.next.val == val)
prev.next = prev.next.next;
else
prev = prev.next;
}
return dummyHead.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;
}
}
Test
public static void main(String[] args) {
int[] nums = {1, 2, 6, 3, 4, 5, 6};
ListNode head = new ListNode(nums);
System.out.println(head);
ListNode res = (new Solution()).removeElements(head, 6);
System.out.println(res);
}