Consider The Linkedlist Class Implementation In The Answer Box Below Extend The Linkedlist Class By Adding The Method S 1 (181.36 KiB) Viewed 9 times
Consider The Linkedlist Class Implementation In The Answer Box Below Extend The Linkedlist Class By Adding The Method S 2 (73.15 KiB) Viewed 9 times
Consider The Linkedlist Class Implementation In The Answer Box Below Extend The Linkedlist Class By Adding The Method S 3 (107.78 KiB) Viewed 9 times
Consider the LinkedList class implementation in the answer box below. Extend the LinkedList class by adding the method string_subtractions (self) which returns a string. Starting with a string initialized to the value of the data component of the head node, the method removes from this string, the string in the data component of each of the remaining nodes in the linked list. For example, if the linked list contains the following values: 'copyright' -> 'right' -> 'py', then the string returned is 'co'. The method starts with the string 'copyright". It then removes 'right' from the string and then removes 'py' from the string, leaving the string to be returned as "co". You can use the replace() method to remove substrings from another string by replacing the substring with an empty string. The replace() method replaces a specified phrase with another specified phrase. For example, the following code: message = "I like bananas" new_message = message.replace(" ", "") print (new_message) produces: Ilikebananas Note: Submit the entire LinkedList class definition in the answer box below. You can assume that the linked list contains at least 1 element. IMPORTANT: A Node implementation is provided to you as part of this exercise - you should not define your own Node class. Instead, your code can make use of any of the Node ADT data fields (e.g. data and next) and methods. For example: Test Result
Test text = LinkedList() text.add('ig') text.add('co') text.add('e') text.add('copyright') print (text) print (text.string_subtractions()) text = LinkedList() text.add('copyright') text.add('right') print (text) print(text.string_subtractions()) Result copyright > e-> co -> ig -> None pyrht right copyright -> None right Time left 0:44:27
1 class LinkedList: ▼ 2, STEN 3 4 5 6 7 8 9 10 11, 12 13 14 15, 16 17 18 19, 20 definit__(self): self.head = None self.count = 0 def add(self, item): #change this method to update self.count new_node = Node(item, self.head) self.head = new_node self.count += 1 def_str__(self): if self.head != None: 11 11 result current = self.head while current: "1 result result + str(current) + current current.next return result + "None" return else: ^
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!