训练营一期第3天

# 203. 移除链表元素

- 视频链接：手把手带你学会操作链表 | LeetCode：203.移除链表元素_哔哩哔哩_bilibili

- 第一想法：由于之前一直用的是python，没有接触过链表，不太清楚具体怎么操作

- 看完代码随想录的想法：

def removeElements(self, head, val):
    """
    :type head: ListNode
    :type val: int
    :rtype: ListNode
    """
    dummy_head = ListNode(next=head)
    pointer = dummy_head
    while pointer.next != None:
        if pointer.next.val == val:
            pointer.next = pointer.next.next
        else:
            pointer = pointer.next
    
    return dummy_head.next

设置一个虚拟头dummy_head，指向head。遍历链表，如果有node的val等于val，让node.next指向node.next.next.

# 707.设计链表

- 视频链接：帮你把链表操作学个通透！LeetCode：707.设计链表_哔哩哔哩_bilibili

- 第一想法：不太清楚怎么写以下两个functions。因为我用python的时候，基本没用过class和def _init_

class Node(object):
    def __init__(self, x=0):
        self.val = x
        self.next = None

class MyLinkedList(object):

    def __init__(self):
        self.head = Node()
        self.size = 0

​​​​​​- 看完代码随想录的想法是：

要想清楚这个head指的是dummy head还是真实的head。这很影响后面每个function怎么写。

class Node(object):
    def __init__(self, x=0):
        self.val = x
        self.next = None

class MyLinkedList(object):

    def __init__(self):
        self.head = Node()
        self.size = 0


    def get(self, index):
        """
        :type index: int
        :rtype: int
        """
        if index < 0 or index >= self.size:
            return -1
        cur = self.head
        while(index):
            cur = cur.next
            index -= 1
        return cur.next.val


    def addAtHead(self, val):
        """
        :type val: int
        :rtype: None
        """
        new_node = Node(val)
        new_node.next = self.head.next
        self.head.next = new_node
        self.size += 1


    def addAtTail(self, val):
        """
        :type val: int
        :rtype: None
        """
        new_node = Node(val)
        cur = self.head
        while(cur.next):
            cur = cur.next
        cur.next = new_node
        self.size += 1



    def addAtIndex(self, index, val):
        """
        :type index: int
        :type val: int
        :rtype: None
        """
        if index == self.size:
            self.addAtTail(val)
            return
        elif index > self.size:
            return 
        elif index < 0:
            self.addAtHead(val)
            return
        else:
            new_node = Node(val)
            cur = self.head
            while index:
                cur = cur.next
                index -= 1
            new_node.next = cur.next
            cur.next = new_node
            self.size += 1

      


    def deleteAtIndex(self, index):
        """
        :type index: int
        :rtype: None
        """
        if index < 0 or index >= self.size:
            return

        cur = self.head
        while index:
            cur = cur.next
            index -= 1
        cur.next = cur.next.next
        self.size -= 1

# 206.反转链表

- 视频链接：帮你拿下反转链表 | LeetCode：206.反转链表 | 双指针法 | 递归法_哔哩哔哩_bilibili

- 第一想法：是否需要遍历到最后一个node再开始反转，但没想出来怎么写

- 看完代码随想录的想法：

def reverseList(self, head):
    """
    :type head: ListNode
    :rtype: ListNode
    """
    pointer1 = None 
    pointer2 = head 

    while pointer2 != None:
        tmp = pointer2.next
        pointer2.next = pointer1
        pointer1 = pointer2
        pointer2 = tmp
    
    return pointer1

更新pointer1的部分，是我没有太理解到的部分。

- 困难：对链表不太熟悉。之后需要在巩固一下