移除鏈表元素

刪除鏈表中等于給定值 val 的所有節(jié)點。
示例:
輸入: 1->2->6->3->4->5->6, val = 6
輸出: 1->2->3->4->5

思路:

定義一個虛擬頭結點, newNode = ListNode(0) 從頭部往尾部循環(huán), 取 newNode.next.val == 給定的val 
例如 A-> B-> C-> D  要刪除 C ( B.next ) 只需要 A-> B -> D
B .next = D   即 是  B.next = B.next.next

Java實現(xiàn)

    public ListNode removeElements(ListNode head, int val) {
        if (head == null) return null;
        ListNode newNode = new ListNode(0);
        newNode.next = head;

        ListNode node = newNode;
        while (newNode.next != null) {
            if (newNode.next.val == val) {
                newNode.next = newNode.next.next;
            } else {
                newNode = newNode.next;
            }
        }
        return node.next;
    }

Swift實現(xiàn)

    func removeElements(_ head: ListNode?, _ val: Int) -> ListNode? {
        if head == nil {
            return nil
        }
        var newHead = ListNode(0)
        newHead.next = head
        let node = newHead
        
        while newHead.next != nil {
            if newHead.next?.val == val {
                newHead.next = newHead.next?.next
            } else {
                newHead = newHead.next!
            }
        }
        
        return node.next
        
    }
    
     public class ListNode {
        public var val: Int
        public var next: ListNode?
        public init(_ val: Int) {
            self.val = val
            self.next = nil
        }
    }