笔记
qq_1158406306
这个作者很懒,什么都没留下…
展开
-
最长无重复子串 和 公共子串长度
1、最长无重复子串 class Solution: def lengthOfLongestSubstring(self, s: str) -> int: if not s: return 0 queue = [s[0]] dic = {s[0]:0} max_len = 1 tmp = 1 for i in range(1,len(s)): if s原创 2021-10-02 15:26:18 · 63 阅读 · 0 评论 -
两个栈实现一个队列和两个队列实现一个栈
两个栈实现一个队列 class MyQueue: def __init__(self): self.A = [] self.B = [] def push(self, x: int) -> None: self.A.append(x) def pop(self) -> int: if self.B: return self.B.pop() else:原创 2021-09-21 13:12:44 · 59 阅读 · 0 评论 -
2021-07-14
删除排序链表中重复的元素 # 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 deleteDuplicates(self, head): """ :t原创 2021-07-14 00:19:45 · 99 阅读 · 0 评论 -
2021-06-16
合并两个有序链表 # Definition for singly-linked list. class ListNode(object): def __init__(self, x): self.val = x self.next = None class Solution(object): def mergeTwoLists(self, l1, l2): """ :type l1: ListNode :typ原创 2021-06-16 00:06:40 · 65 阅读 · 0 评论