代码随想录算法训练营Day3|链表1

203.移除链表元素

【简单题】【题目链接】

• 虚拟头结点简化删除头结点的过程
• 注意循环判断条件

class Solution:
    def removeElements(self, head: Optional[ListNode], val: int) -> Optional[ListNode]:
        dummy = ListNode(next=head) #虚拟结点简化删除头结点
        current = dummy
        while(current.next):
            if current.next.val == val:
                current.next = current.next.next
            else:
                current = current.next
        return dummy.next

707.设计链表

【中等题】【题目链接】

• 注意size的判断，add和get时，size的判断不一样
• 有单向链表和双向链表两种方式，暂时只写了单向

## 单向链表的定义
class ListNode:
    def __init__(self, val=0, next=None):
        self.val = val
        self.next = next

class MyLinkedList:

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

    def get(self, index: int) -> int:
        if index<0 or index>=self.size:
            return -1
        node = self.dummy.next
        while(index):
            node = node.next
            index -= 1
        return node.val

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

    def addAtTail(self, val: int) -> None:
        node = self.dummy
        for i in range(self.size):
            node = node.next
        node.next = ListNode(val=val)
        self.size += 1

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

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

206.反转链表

【中等题】【题目链接】

• 有印象是用双指针，但是pre和cur最开始的赋值没考虑出来
• 链表反向过程的赋值顺序不熟练，还重新画图想了一遍（两排等式左上和右下一样的话就需要检查了，因为多余步骤赋值了！）

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