mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-01-19 00:37:02 +00:00
Code Issues Packages Projects Releases Wiki Activity

enhance swapping code in link (#1660)

Browse Source 
* enhance swapping code in link

* heapify do not recursive

* fix

* fix identifier and add test

* typing.Any and LinkedList instead of Linkedlist

* typing.Any and LinkedList instead of Linkedlist
This commit is contained in:
lanzhiwang 2020-01-14 17:02:15 +08:00 committed by onlinejudge95
parent b492e64417
commit 56e7ae01d2
1 changed files with 26 additions and 43 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

69
data_structures/linked_list/swap_nodes.py
View File

@ -1,72 +1,55 @@
from typing import Any
class Node: class Node:
def __init__(self, data): def __init__(self, data: Any):
self.data = data self.data = data
self.next = None self.next = None
class Linkedlist: class LinkedList:
def __init__(self): def __init__(self):
self.head = None self.head = None
def print_list(self): def print_list(self):
temp = self.head temp = self.head
while temp is not None: while temp is not None:
print(temp.data) print(temp.data, end=' ')
temp = temp.next temp = temp.next
print()
# adding nodes # adding nodes
def push(self, new_data): def push(self, new_data: Any):
new_node = Node(new_data) new_node = Node(new_data)
new_node.next = self.head new_node.next = self.head
self.head = new_node self.head = new_node
# swapping nodes # swapping nodes
def swapNodes(self, d1, d2): def swap_nodes(self, node_data_1, node_data_2):
prevD1 = None if node_data_1 == node_data_2:
prevD2 = None
if d1 == d2:
return return
else: else:
# find d1 node_1 = self.head
D1 = self.head while node_1 is not None and node_1.data != node_data_1:
while D1 is not None and D1.data != d1: node_1 = node_1.next
prevD1 = D1
D1 = D1.next node_2 = self.head
# find d2 while node_2 is not None and node_2.data != node_data_2:
D2 = self.head node_2 = node_2.next
while D2 is not None and D2.data != d2:
prevD2 = D2 if node_1 is None or node_2 is None:
D2 = D2.next
if D1 is None and D2 is None:
return return
# if D1 is head
if prevD1 is not None:
prevD1.next = D2
else:
self.head = D2
# if D2 is head
if prevD2 is not None:
prevD2.next = D1
else:
self.head = D1
temp = D1.next
D1.next = D2.next
D2.next = temp
node_1.data, node_2.data = node_2.data, node_1.data
# swapping code ends here
if __name__ == "__main__": if __name__ == "__main__":
list = Linkedlist() ll = LinkedList()
list.push(5) for i in range(5, 0, -1):
list.push(4) ll.push(i)
list.push(3)
list.push(2)
list.push(1)
list.print_list() ll.print_list()
list.swapNodes(1, 4) ll.swap_nodes(1, 4)
print("After swapping") print("After swapping")
list.print_list() ll.print_list()