题目链接：https://leetcode-cn.com/problems/shan-chu-lian-biao-de-jie-dian-lcof/
难度：简单

描述：
给定单向链表的头指针和一个要删除的节点的值，定义一个函数删除该节点。
返回删除后的链表的头节点。
注意：此题对比原题有改动

题解

  1. # Definition for singly-linked list.
  2. # class ListNode:
  3. #     def __init__(self, x):
  4. #         self.val = x
  5. #         self.next = None
  6. class Solution:
  7.     def deleteNode(self, head: ListNode, val: int) -> ListNode:
  8.         dummy = ListNode(-1, head)
  9.         pre = dummy
  10.         cur = dummy.next
  12.         while cur is not None:
  13.             if cur.val == val:
  14.                 pre.next = cur.next
  15.                 break
  16.             else:
  17.                 pre = pre.next
  18.                 cur = pre.next
  20.         return dummy.next