237. Delete Node in a Linked List

문제

There is a singly-linked list head and we want to delete a node node in it.

You are given the node to be deleted node. You will not be given access to the first node of head.

All the values of the linked list are unique, and it is guaranteed that the given node node is not the last node in the linked list.

Delete the given node. Note that by deleting the node, we do not mean removing it from memory. We mean:

The value of the given node should not exist in the linked list.
The number of nodes in the linked list should decrease by one.
All the values before node should be in the same order.
All the values after node should be in the same order.

https://leetcode.com/problems/delete-node-in-a-linked-list/

접근

#연결리스트

[5,1,2,3] 에서 주어진 노드가 1이라면, 1을 바로 뒤에 있는 2의 노드로 교체한 뒤 기존 2의 노드를 삭제한다.

코드

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

class Solution:
    def deleteNode(self, node):
        """
        :type node: ListNode
        :rtype: void Do not return anything, modify node in-place instead.
        """
        nt = node.next
        node.val = nt.val
        node.next = nt.next

효율성

O(1)

Runtime: 69 ms, faster than 55.47% of Python3 online submissions for Delete Node in a Linked List.
Memory Usage: 14.1 MB, less than 91.10% of Python3 online submissions for Delete Node in a Linked List.