代码随想录算法训练营DAY03｜链表理论基础、203.移除链表元素、707.设计链表、206.反转链表

链表理论基础

	插入/删除	查询	适用场景
数组	O(n)	O(1)	数据量固定，频繁查询，较少增删
链表	O(1)	O(n)	数据量不固定，频繁增删，较少查询

但是要注意，要是删除第五个节点，需要从头节点查找到第四个节点通过next指针进行删除操作，查找的时间复杂度是O(n)。

• 链表定义

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

移除链表元素

• 题目链接：移除链表元素
• 不设置单独头节点的情况，head需要单独处理

# 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
        """

        # in case all Node.val==val
        # pre = pre.next 不行，因为return head
        while head and head.val==val:
            head=head.next
        pre = head
        
        if pre:
            if pre.next:
                p=pre.next
            else:
                return pre
        else:
            return None
            
        while pre.next:
            if pre.next.val == val:
                pre.next = pre.next.next
            else:
                pre = pre.next
        
        return head

• 有头节点版本

# 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)
        cur = dummy_head

        while cur.next:
            if  cur.next.val==val:
                cur.next = cur.next.next
            else:
                cur =cur.next

        return dummy_head.next

设计链表

• 题目链接：设计链表
• 虚拟头节点可以简化很多操作
• 设置size，注意0<=index<self.size

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

class MyLinkedList(object):
    def __init__(self, val=0, next=None):
        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
        p = self.dummy_head.next
        while index and p:
            p = p.next
            index -= 1
        
        return p.val if p else -1

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


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

    def addAtIndex(self, index, val):
        """
        :type index: int
        :type val: int
        :rtype: None
        """
        if index<=self.size and index >=0:
            p = self.dummy_head
            while index:
                p = p.next
                index -= 1
            p.next = ListNode(val = val, next = p.next)

            self.size += 1

    def deleteAtIndex(self, index):
        """
        :type index: int
        :rtype: None
        """
        if index<self.size and index>=0:
            p = self.dummy_head
            while index:
                p = p.next
                index -= 1
            p.next = p.next.next

            self.size -= 1

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

反转链表

• 题目链接：反转链表
• 虚拟头节点+遍历反向插入

# 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
        """
        dummy_head = ListNode()
        cur = head
        while cur:
            tmp1 = cur.next
            tmp = dummy_head.next
            dummy_head.next = cur
            dummy_head.next.next = tmp
        
            cur = tmp1

        return dummy_head.next

• 双指针法
  • cur正向遍历所有链表节点
  • prev有点像一个tmp，用于存储已经反转好的链表

# 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
        """
        prev = None
        cur = head
        tmp = None
        while cur:
            tmp = cur.next
            cur.next = prev
            prev = cur
            cur = tmp
        
        return prev