203. Remove Linked List Elements

203. Remove Linked List Elements

 

QuestionEditorial Solution

 My Submissions

• Total Accepted: 84015
• Total Submissions: 276356
• Difficulty: Easy

太傻逼了。

以后记住判断条件&&前后顺序是有关系的

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.

Subscribe to see which companies asked this question

/**
 * 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) {
        if (head == null) {
            return null;
        }
        ListNode dummy = head;
        while (dummy != null && dummy.val == val ) {
            dummy = head.next;
            head = head.next;
        }
        while (head != null && head.next != null) {
            if (head.next.val == val) {
                head.next = head.next.next;
            }
            else {
                head = head.next;
            }
        }
        return dummy;
    }
}