代码随想录训练营DAY03

程序员正在诞生中

已于 2024-08-03 12:03:46 修改

阅读量162

点赞数 1

分类专栏：代码随想录打卡文章标签： python 开发语言

于 2024-08-03 12:03:22 首次发布

本文链接：https://blog.csdn.net/weixin_71888551/article/details/140887876

版权

代码随想录打卡专栏收录该内容

8 篇文章 0 订阅

订阅专栏

链表移除Python版本

# 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
        """
        headNode = ListNode(next = head)
        current = headNode
        while current.next:
            if current.next.val == val:
                current.next = current.next.next
            else:
                current = current.next
        return headNode.next

链表各接口：头插，尾插，在某个位置插入新节点，获取某个位置节点的值，删除某个位置节点

class ListNode:

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


class MyLinkedList:

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


    def get(self, index: int) -> int:
        if index < 0 or index >= self.size:
            return -1
        cur = self.head
        for _ in range(index + 1):
            cur = cur.next
        return cur.val


    def addAtHead(self, val: int) -> None:
        self.addAtIndex(0, val)


    def addAtTail(self, val: int) -> None:
        self.addAtIndex(self.size, val)


    def addAtIndex(self, index: int, val: int) -> None:
        if index > self.size:
            return
        index = max(0, index)
        self.size += 1
        pred = self.head
        for _ in range(index):
            pred = pred.next
        to_add = ListNode(val)
        to_add.next = pred.next
        pred.next = to_add

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

翻转链表

class Solution:
    def reverseList(self, head: ListNode) -> ListNode:
        cur = head   
        pre = None
        while cur:
            temp = cur.next # 保存一下 cur的下一个节点，因为接下来要改变cur->next
            cur.next = pre #反转
            #更新pre、cur指针
            pre = cur
            cur = temp
        return pre