【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

/** * Definition for singly-linked list. * public class ListNode { *     int val; *     ListNode next; *     ListNode(int x) { val = x; } * } */public class Solution {    public ListNode removeElements(ListNode head, int val) {        ListNode temp = new ListNode(-1);        temp.next = head;        ListNode curr = head, prev = temp;        while (curr != null) {            if (curr.val == val) {                prev.next = curr.next;            } else {                prev = prev.next;            }            curr = curr.next;        }        return temp.next;    }}