LeetCode 203 Remove Linked List Elements

题目描述

Remove all elements from a linked list of integers that have value val.

Example
Given: 1 –> 2 –> 6 –> 3 –> 4 –> 5 –> 6, val = 6
Return: 1 –> 2 –> 3 –> 4 –> 5

Credits:
Special thanks to @mithmatt for adding this problem and creating all test cases.

---

分析

参考：西施豆腐渣的CSDN博客，leetcode 203: Remove Linked List Elements

---

代码

    public static ListNode removeElements(ListNode head, int val) {        ListNode dummy = new ListNode(0);        dummy.next = head;        ListNode p = dummy;        ListNode q = head;        while (q != null) {            if (q.val == val) {                p.next = q.next;            } else {                p = p.next;            }            q = q.next;        }        return dummy.next;    }