链表:
和数列不同,链表是通过class自己定义node节点,通过 node的变量 node.next 指向下一个node,而下一个node也是如此..一直延续下去
代码随想录 day3
头一次接触这样的数据结构,感觉比较抽象,但是做过一次题目,晚上第二次做就感觉好多了。
感觉虚拟头结点还是很重要的,是一种包容性的措施:
1)当真实的头结点是None,也就是链表为空时,我们不能对其真实表头进行任何Node class里面的操作,创建一个虚拟头节点,我们可以很放心的开始循环
2)创建空列表也需要 虚拟头结点,单纯创建一个None难以使用
见下文def_init__(self)
3) 个人感觉没有虚拟头节点也可以,写起来也不是很难,但是思考起来更复杂。函数里每次开启循环前都需要确保真实头结点不是None,这实在是太麻烦了
(ps:有了头结点需要注意循环次数+1)
class Node:
def __init__(self, val = 0, next =None):
self.val = val
self.next = next
class MyLinkedList:
def __init__(self):
self.dumb_head = Node()
self.size = 0
def get(self, index: int) -> int:
if index <0 or index >= self.size:
return -1
cur_node = self.dumb_head
for i in range(index+1):
cur_node = cur_node.next
return cur_node.val
def addAtHead(self, val: int) -> None:
self.dumb_head.next = Node(val = val, next = self.dumb_head.next)
self.size +=1
def addAtTail(self, val: int) -> None:
cur_node = self.dumb_head
for i in range(self.size):
cur_node = cur_node.next
cur_node.next = Node(val =val)
self.size +=1
def addAtIndex(self, index: int, val: int) -> None:
if index<0 or index > self.size:
return
cur_node = self.dumb_head
for i in range(index):
cur_node = cur_node.next
cur_node.next = Node(val = val, next = cur_node.next)
self.size +=1
def deleteAtIndex(self, index: int) -> None:
if index<0 or index >= self.size:
return
cur_node = self.dumb_head
for i in range(index):
cur_node = cur_node.next
cur_node.next = cur_node.next.next
self.size -=1
# Your MyLinkedList object will be instantiated and called as such:
# obj = MyLinkedList()
# param_1 = obj.get(index)
# obj.addAtHead(val)
# obj.addAtTail(val)
# obj.addAtIndex(index,val)
# obj.deleteAtIndex(index)
最近各方面还OK,就是生活没那么精彩,坚持一下,会有花开的