forked from K-Hacks/HacktoberFest-2022
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathLinkedList.py
116 lines (101 loc) · 3.27 KB
/
LinkedList.py
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
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
from typing import Optional
class Node:
"""
This class describes Node objects to act as elements of the LinkedList
Attributes:
-> data - stored associated data
-> next - link to next node
"""
def _init_(self, data=None, next=None):
"""
Initialises the Node with given attributes
"""
self.data = data
self.next = next
class LinkedList:
"""
This class implements LinkedList using Node objects
Methods:
-> insert_at_end - inserts node with data at the end of the list
-> status - displays all elements of the lisT
Attributes
-> self.head - contains first node of LinkedList, None if list empty
"""
def _init_(self):
"""
Initialize the head
"""
self.head = None
def insert_at_end(self, data):
"""
Insert node at end of the list
:param data: integer data that will be used to create a node
"""
new = Node(data, None)
curr = self.head
if curr is None:
self.head = new
else:
while curr.next is not None:
curr = curr.next
curr.next = new
def status(self):
"""
It prints all the elements of list.
"""
elements = []
curr = self.head
while curr:
elements.append(curr.data)
curr = curr.next
print(elements)
class Solution:
"""
Class implementing functions to add numbers in a LinkedListT
"""
def addTwoNumbers(self, first_list: Optional[LinkedList], second_list: Optional[LinkedList]) -> Optional[
LinkedList]:
"""
:param first_list: Linkedlist with non-negative integers
:param second_list: Linkedlist with non-negative integers
:return: returns the sum as a linked list
"""
result = self.get_num(first_list) + self.get_num(second_list)
sum_list = LinkedList()
for digit in list(map(int, str(result)[::-1])):
sum_list.insert_at_end(digit)
return sum_list
def get_num(self, l: Optional[LinkedList]) -> int:
"""
:param l: LinkedList with non-negative integers
:return: returns digits of the list as a single integer
"""
curr = l.head
if curr is None:
return 0
num = ""
while curr is not None:
num = str(curr.data) + num
curr = curr.next
return int(num)
# Do not edit the following code
# Create an instance for LinkedList
first_list = LinkedList()
# Create an another instance for LinkedListT
second_list = LinkedList()
# Read data for first list
data_for_first_list = list(map(int, input().strip().split(" ")))
# Add data at the end of first_list
for data in data_for_first_list:
first_list.insert_at_end(data)
# Read data for second list
data_for_second_list = list(map(int, input().strip().split(" ")))
# Add data at the end of second_list
for data in data_for_second_list:
second_list.insert_at_end(data)
# Create an instance for Solution
solution = Solution()
# Pass first_list and second_list to addTwoNumbers, which returns a new linked list
new_list = solution.addTwoNumbers(first_list, second_list)
# Display the status of new_list
new_list.status()