leetcode-203. 删除链表中的节点

题目

删除链表中等于给定值 val 的所有节点。

示例:

输入: 1->2->6->3->4->5->6, val = 6
输出: 1->2->3->4->5

思路

1. 判断head是否为空
2. 判断head.val是否等于val
3. 构造两个节点，一个等于当前节点，一个等于当前节点的上一个节点，便于删除节点

python代码

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution:
    def removeElements(self, head, val):
        """
        :type head: ListNode
        :type val: int
        :rtype: ListNode
        """
        if head == None:
            return head
        while head != None and head.val == val:
            head = head.next
        if head == None:
            return head
        L = ListNode(0)
        L2 = ListNode(0)
        L1 = head
        while L1 != None:
            if L1.val == val:
                L2.next = L1.next
                L1 = L1.next
            else:
                L2 = L1
                L1 = L1.next
        return head
                
        

java代码

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