237. Delete Node in a Linked List
Leetcode link for this question
Discription:
Write a function to delete a node (except the tail) in a singly linked list, given only access to that node.
Supposed the linked list is 1 -> 2 -> 3 -> 4 and you are given the third node with value 3, the linked list should become 1 -> 2 -> 4 after calling your function.
Analyze:
Code 1:
# Definition for singly-linked list.
# class ListNode(object):
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution(object):
def show(self,node):
while(node):
print node.val
node=node.next
def deleteNode(self, node):
"""
:type node: ListNode
:rtype: void Do not return anything, modify node in-place instead.
"""
if node and node.next:
node.val=node.next.val ##Modifying formal parameter dose not work
node.next=node.next.next ##the true way is to modify the actual parameter in internal storage
Submission Result:
Status: Accepted
Runtime: 56 ms
Ranking: beats 90.83%