代码随想录训练营day3|203. 移除链表元素707. 设计链表206. 反转链表

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, val=0, next=None):
#         self.val = val
#         self.next = next
class Solution:
    def removeElements(self, head: Optional[ListNode], val: int) -> Optional[ListNode]:
        dummy_node = ListNode(next = head)
        cur = dummy_node
        while cur.next:
            if cur.next.val == val:
                cur.next = cur.next.next 
            else:
                cur = cur.next
        return dummy_node.next

移除链表元素，这里的cur是当前要删除的节点的前一个节点，这个思路很好，之前写的是用了cur和prev，cur是当前节点进行判断，用prev删除。在链表的题目中要注意节点的移动和是否会取到null边界条件

class Listnode:
    def __init__(self,val=0,next=None):
        self.val = val
        self.next = next
class MyLinkedList:

    def __init__(self):
        self.dummy_node = Listnode()
        self.size = 0

    def get(self, index: int) -> int:
        if index >= self.size or index < 0:
            return -1
        else:
            cur = self.dummy_node
            for _ in range(index):
                cur = cur.next
            return cur.next.val


    def addAtHead(self, val) :
        new_node = Listnode(val, next=self.dummy_node.next)
        self.dummy_node.next = new_node
        self.size +=1


    def addAtTail(self, val: int) -> None:
        cur = self.dummy_node
        while cur.next:
            cur=cur.next
        cur.next = Listnode(val)
        self.size +=1

    def addAtIndex(self, index: int, val: int) -> None:
        cur = self.dummy_node
        if index <= self.size and index>=0:
            for _ in range(index):
                cur= cur.next
            new_node=Listnode(val,next = cur.next)
            cur.next = new_node
            self.size +=1


    def deleteAtIndex(self, index: int) -> None:
        cur = self.dummy_node
        if index < self.size and index>=0:
            for _ in range(index):
                cur= cur.next
            cur.next  =cur.next.next
            self.size -=1



# Your MyLinkedList object will be instantiated and called as such:
obj = MyLinkedList()
# param_1 = obj.get(index)
obj.addAtHead(1)
obj.addAtTail(3)
obj.addAtIndex(1,2)
param_1 = obj.get(1)
obj.deleteAtIndex(1)
param_1 = obj.get(1)

设计链表的最大问题是在__init__时初始化的是虚拟节点（类似头节点的作用）而不是第一个节点

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, val=0, next=None):
#         self.val = val
#         self.next = next
class Solution:
    def reverseList(self, head: Optional[ListNode]) -> Optional[ListNode]:
        prev = None
        cur = head
        while cur:
            temp = cur.next
            cur.next = prev
            prev =cur
            cur = temp
        return prev 
            

这里prev不能是虚拟头节点，因为就多了一个节点，而且连着head节点，导致成环，内存报错