Permalink
Cannot retrieve contributors at this time
Name already in use
A tag already exists with the provided branch name. Many Git commands accept both tag and branch names, so creating this branch may cause unexpected behavior. Are you sure you want to create this branch?
Algorithms-Basics-Python/LinkedList.py
Go to fileThis commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
101 lines (81 sloc)
2.86 KB
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#Single-link Linked List | |
class Node(object): | |
def __init__(self, value): | |
self.value = value | |
self.nextNode = None | |
def getValue(self): | |
'''Gets the value of the current node''' | |
return self.value | |
def setValue(self, newValue): | |
'''Sets the value of the current node''' | |
self.value = newValue | |
def getNextNode(self): | |
'''Gets the next node in the list''' | |
return self.nextNode | |
def setNextNode(self, newNext): | |
'''Sets the next node to a new node''' | |
self.nextNode = newNext | |
class LinkedList(object): | |
def __init__(self, head = None): | |
self.head = head | |
self.nodeCount = 0 | |
def getNodeCount(self): | |
'''Gets the number of nodes in the list''' | |
return self.nodeCount | |
def insertNode(self, nodeData): | |
'''Inserts new node at the head of the list''' | |
newNode = Node(nodeData) | |
newNode.setNextNode(self.head) | |
self.head = newNode | |
self.nodeCount += 1 | |
def searchList(self, target): | |
'''Searches the list for a target value''' | |
currentNode = self.head | |
while(currentNode != None): | |
if currentNode.getValue() == target: | |
return currentNode | |
else: | |
currentNode = currentNode.getNextNode() | |
return None | |
def deleteAt(self, index): | |
'''Deletes a node at a given index in the list''' | |
if index > self.nodeCount-1: | |
return | |
if index == 0: | |
self.head = self.head.getNextNode() #Deletes the head (index 0) | |
else: | |
count = 0 | |
currentNode = self.head | |
while count < index - 1: | |
currentNode = currentNode.getNextNode() | |
count += 1 | |
currentNode.setNextNode(currentNode.getNextNode().getNextNode()) | |
self.nodeCount -= 1 | |
def printList(self): | |
'''Prints the whole list''' | |
currentNode = self.head | |
if currentNode == None: | |
print("List is empty") | |
else: | |
while(currentNode != None): | |
print("Node:", currentNode.getValue()) | |
currentNode = currentNode.getNextNode() | |
testList = LinkedList() | |
testList.insertNode(45) | |
testList.insertNode(87) | |
testList.insertNode(12) | |
testList.insertNode(1) | |
testList.insertNode(43) | |
testList.printList() | |
print("\nTEST SET 1 --------------------------------\n") | |
print("Node Count:", testList.getNodeCount()) | |
print("Search for 45:", testList.searchList(45)) | |
print("Search for 900:", testList.searchList(900)) | |
print("\nTEST SET 2 --------------------------------\n") | |
print("Node Count:", testList.getNodeCount()) | |
print("Search for 12:", testList.searchList(12)) | |
print("Attempting to delete 12 at index 2") | |
testList.deleteAt(2) | |
print("Node Count:", testList.getNodeCount()) | |
print("Search for 12:", testList.searchList(12)) | |
testList.printList() |