-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathll_del.py
More file actions
68 lines (56 loc) · 1.41 KB
/
ll_del.py
File metadata and controls
68 lines (56 loc) · 1.41 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
#Done at 1st try
#https://www.hackerrank.com/challenges/delete-a-node-from-a-linked-list/problem
#!/bin/python3
import math
import os
import random
import re
import sys
class SinglyLinkedListNode:
def __init__(self, node_data):
self.data = node_data
self.next = None
class SinglyLinkedList:
def __init__(self):
self.head = None
self.tail = None
def insert_node(self, node_data):
node = SinglyLinkedListNode(node_data)
if not self.head:
self.head = node
else:
self.tail.next = node
self.tail = node
def print_singly_linked_list(node, sep, fptr):
while node:
fptr.write(str(node.data))
node = node.next
if node:
fptr.write(sep)
# Complete the deleteNode function below.
#
# For your reference:
#
# SinglyLinkedListNode:
# int data
# SinglyLinkedListNode next
#
#
def deleteNode(head, position):
# x=SinglyLinkedListNode(data)
if head==None and position==0:
return None
if position==0 and head:
ptr=head.next
return ptr
if position and head:
ptr=head
while position!=1:
ptr=ptr.next
position-=1
# x.next=ptr.next
# ptr.next=x
# return head
ptr.next=ptr.next.next
return head
if __name__ == '__main__':