Take a moment to think about what would the data structure of a linked list look like in Python.
self.data = data
self.next = None
Each element of the Linked List is a node which contains data and a next pointer.
We use pointer to indicate a Python variable, which is not the same as the * operator.
To reverse a Linked List, you have to recursively put the current head as the previous node, the list head will become the second to last element and points to None, while the list tail is now the new head.
It's assume that the Linked List has a head pointer just like all Linked Lists defined by its abstract data structure (ADS)
current = head
prev = None
next = None
next = current.next
current.next = prev
prev = current
current = next
It gets a bit confusing in the middle. It's important to remember that the previous pointer starts with None, because the old head points to None after being reversed. Next serves as a temp pointer, we need to temporarily store current.next, and change it to previous. Since we just completed processing the current node, we store it in the new prev variable, which has the current and new current.next. Then store the next node as the current node. The order matters when assigning current.next and the new current.
Wednesday, December 13, 2017
Data visualization of common math formula.
This review is updated continuously throughout the program. Yay I just joined the Udacity Nanodegree for Digital Marketing! I am such an Uda...
All you need to know about Snap IPO. Tech startup news explained for Youtubers in minutes.
The bogus request from P2PU to hunt for HTML tags in real life has yielded a lot of good thoughts. My first impression was that this is stup...