203. Remove Linked List Elements (E)

Remove Linked List Elements (E)

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

Example:

Input:  1->2->6->3->4->5->6, val = 6
Output: 1->2->3->4->5

---

题意

将给定链表中所有含有指定值的结点删除。

思路

注意需要连续删除结点的情况。

---

代码实现

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    public ListNode removeElements(ListNode head, int val) {
        ListNode dumb = new ListNode(0);
        dumb.next = head;
        ListNode pre = dumb;
        ListNode cur = head;

        while (cur != null) {
            if (cur.val == val) {
                pre.next = cur.next;
                cur = cur.next;
            } else {
                pre = pre.next;
                cur = cur.next;
            } 
        }

        return dumb.next;
    }
}

来源：CSDN

作者：绿色小光头

链接：https://blog.csdn.net/mapoos/article/details/103840116