首页 > itarticle > algorithm notes: leetcode#237 delete node in a linked list

algorithm notes: leetcode#237 delete node in a linked list

admin 11月 12, 2020 0

Problem

Solution

Analysis

Python implementation

# class ListNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.next = None
class (object):
    def deleteNode(self, node):
        """
        :type node: ListNode
        :rtype: void Do not return anything, modify node in-place instead.
        """
        node.val = node.next.val
        node.next = node.next.next

Java implementation

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class  {
    public void deleteNode(ListNode node) {
        node.val = node.next.val;
        node.next = node.next.next;
    }
}

Time complexity

O(1).

Space complexity

O(1).

Link

237. Delete Node in a Linked List
(中文版) 算法笔记: 力扣#237 删除链表中的节点