代码随想录算法训练营第三天 |203.移除链表元素 、 707.设计链表 、206.反转链表

203.移除链表元素

题目链接：力扣

文章链接：代码随想录

# Definition for singly-linked list.
 class ListNode(object):
     def __init__(self, val=0, next=None):
         self.val = val
         self.next = next
class Solution(object):
    def removeElements(self, head, val):
        """
        :type head: ListNode
        :type val: int
        :rtype: ListNode
        """
        # 创建虚拟头部节点以简化删除过程
        dummy_head = ListNode(next = head)
        
        # 遍历列表并删除值为val的节点
        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 ListNode(object):

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

class MyLinkedList(object):

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


    def get(self, index):
        """
        :type index: int
        :rtype: int
        """
        if index < 0 or index >= self.size:
            return -1
        
        current = self.dummy_head.next
        for _ in range(index):
            current = current.next
        
        return current.val
            
            

    def addAtHead(self, val):
        """
        :type val: int
        :rtype: None
        """
        newNode = ListNode()
        newNode.val = val
        newNode.next = self.dummy_head.next
        self.dummy_head.next = newNode
        self.size += 1

        
    def addAtTail(self, val):
        """
        :type val: int
        :rtype: None
        """
        current = self.dummy_head
        for _ in range(self.size):
            current = current.next
        current.next = ListNode(val)
        self.size += 1 


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

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


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

206.反转链表 

题目链接：力扣

文章链接：代码随想录

# Definition for singly-linked list.
class ListNode(object):
    def __init__(self, val=0, next=None):
        self.val = val
        self.next = next

class Solution(object):
    def reverseList(self, head):
        """
        :type head: ListNode
        :rtype: ListNode
        """
        slowIndex = None
        fastIndex = head
        while fastIndex:
            temp = fastIndex.next
            fastIndex.next = slowIndex
            slowIndex = fastIndex
            fastIndex = temp
        return slowIndex

leetcode中的头结点是指链表物理上第一个头结点，还是在单链表的开始结点之前设立一个节点？

（思路明天补上！！！）