代码随想录跟练打卡Day3

27 移除元素

解题关键：学习链表中虚拟头节点的使用。dummy_head = Listnode(next=head)

目的：使得链表中的每一个元素都能用同样的方法取得。

class Solution:
    def removeElements(self, head: Optional[ListNode], val: int) -> Optional[ListNode]:
        dummy_head = ListNode(next=head)
        current = dummy_head
        while current.next:
            if current.next.val==val:
                current.next = current.next.next
            else:
                current=current.next
        return dummy_head.next

707设计链表

注意：要写链表的class，每次完成链表更新后记得更新size

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

class MyLinkedList:

    def __init__(self):
        self.dummy_head = ListNode()
        self.size = 0

    def get(self, index: int) -> int:
        if index < 0 or index >= self.size:
            return -1
        curr = self.dummy_head.next
        for i in range(index):
            curr = curr.next
        return curr.val


    def addAtHead(self, val: int) -> None:
        self.dummy_head.next = ListNode(val, self.dummy_head.next)
        self.size += 1


    def addAtTail(self, val: int) -> None:
        curr = self.dummy_head
        while curr.next:
            curr = curr.next
        curr.next = ListNode(val)
        self.size += 1

    def addAtIndex(self, index: int, val: int) -> None:
        if index < 0 or index >= self.size:
            return
        curr = self.dummy_head
        for i in range(index):
            curr = curr.next
        curr.next = ListNode(val, curr.next)
        self.size += 1
    def addAtIndex(self, index: int, val: int) -> None:
        if index < 0 or index > self.size:
            return

        current = self.dummy_head
        for i in range(index):
            current = current.next
        current.next = ListNode(val, current.next)
        self.size += 1

    def deleteAtIndex(self, index: int) -> None:
        if index < 0 or index >= self.size:
            return
        curr = self.dummy_head
        for i in range(index):
            curr = curr.next
        curr.next = curr.next.next
        self.size -= 1

406 反转链表

解题关键：

共三个变量，curr，pre，tem 

初始化：当前curr指向头节点，pre为空

主体内容：

curr.next = pre（这样会使得curr的下一个节点找不到，因此需要用tem保存这个值）然后让pre为当前，curr为下一个，顺序不能错。

循环条件：curr为空，如果是curr.next的话，会少一个数据。

class Solution:
    def reverseList(self, head: Optional[ListNode]) -> Optional[ListNode]:
        curr = head 
        pre = None
        while curr:
            tem = curr.next 
            curr.next = pre
            pre = curr
            curr = tem 
        return pre