leetcode刷题笔记14

面试题18. 删除链表的节点

给定单向链表的头指针和一个要删除的节点的值，定义一个函数删除该节点。

返回删除后的链表的头节点。

# Definition for singly-linked list.# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None
class Solution:
    def deleteNode(self, head: ListNode, val: int) -> ListNode:
    	if not head:
    		return None
    	if head.val == val:
    		return head.next
    	temp = head
    	while temp.next:
    		if temp.next.val == val:
    			temp.next = temp.next.next
    			return head
    		temp = temp.next
    	return head