数据艺术家

之前已经得到了感知机模型f(x)=sign(w⋅x+b)f(x)=sign(w·x+b)f(x)=sign(w⋅x+b)及其假设空间F={f∣Y=fw,b(X),w∈Rn,b∈R}\mathcal{F} = \{f|Y=f_{w,b}(X),w \in R^n,b \in R\}F={f∣Y=fw,b​(X),w∈Rn,b∈R}，完成了统计学习方法的第一个要素：模型。下面考虑按照要按照什么样的准则从假设空间中选取最优模型，即统计学习方法的第二个要素：策略。即当训练数据集线性可分时，如何找出可以将正实例点和

【例2】已知SSS为维n欧式空间中的n-1维超平面S : w⋅x+b=0S \ : \ \bold{w}·x + b =0S : w⋅x+b=0其中 w\bold{w}w 和 xxx 均为n维向量。n维空间中的点 x0=(x0(1),x0(2),⋯ ,x0(n))x_0 = (x_0^{(1)},x_0^{(2)},\cdots,x_0^{(n)})x0​=(x0(1)​,x0(2)​,⋯,x0(n)​) 。求证：点 PPP 到超平面 SSS 的距离 d.

范数 ，对应闵可夫斯基距离 (Minkowski distance) ，其定义如下：【定义2】Lp范数假设n维向量x=(x1,x2,⋯ ,xn)Tx = (x_1,x_2,\cdots,x_n)^Tx=(x1​,x2​,⋯,xn​)T，其Lp范数记作∣∣x∣∣p||x||_p∣∣x∣∣p​，定义为∣∣x∣∣p=(∣x1∣p+∣x2∣p+⋯+∣xn∣p)1p||x||_p = (|x_1|^p+|x_2|^p+\cdots+|x_n|^p)^{\frac{1}{p}}∣∣x∣∣p​=(∣x1​∣p

首先，我们来看下面的例子。【例1】通过给定的身高、体重组合与对应性别的数据，实现对未知身高、体重组合的性别预测。在这个例子中，输入空间为所有可能的身高、体重组合（二维特征向量），记作 X⊆R2\mathcal{X} \subseteq R^2X⊆R2 ；输出空间为所有可能的性别（只有两个取值的离散变量），记作Y⊆{+1,−1}\mathcal{Y} \subseteq \{+1,-1\}Y⊆{+1,−1}。输入实例xxx的特征向量记作x=(x(1),x(2))T∈Xx = (x^{(1)},x^{(2

【示例图】【实现代码】option = { grid: { left: '3%', right: '7%', bottom: '7%', containLabel: true }, tooltip: { // trigger: 'axis', showDelay: 0, formatter: function (params) { if (pa

文章目录基础数学单字符符号多字符符号xy\frac{x}{y}yx​ 分式exe^xex 上下标xy\sqrt[y]{x}yx​ 根式∫ab\int_{a}^{b}∫ab​ 积分∑i=1n\sum^n_{i=1}∑i=1n​ 大型运算符括号括号种类括号列表标注符号集合符号空格符号箭头符号长箭头单字符箭头省略号符号和希腊字母 (大写&小写)特殊符号希腊字母样式符号多行模式发布时间：2021.03.27基础数学单字符符号符号名称符号显示符号代码无穷大∞\infty∞

题目：原题链接（中等）标签：贪心算法、排序、双指针解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(NlogN)O(NlogN)O(NlogN)O(N)O(N)O(N)48ms (57.23%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def bagOfTokensScore(self, tokens: List[int], power: int) -> int

题目：原题链接（中等）标签：数组、排序解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(NlogN)O(NlogN)O(NlogN)O(N)O(N)O(N)320ms (98.61%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def minIncrementForUnique(self, A: List[int]) -> int: count =

题目：原题链接（中等）标签：广度优先搜索、深度优先搜索解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(N2)O(N^2)O(N2)O(N2)O(N^2)O(N2)324ms (16.72%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def shortestBridge(self, A: List[List[int]]) -> int: m =

题目：原题链接（中等）标签：分治算法、递归解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(NlogN)O(NlogN)O(NlogN)O(N)O(N)O(N)52ms (30.77%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def beautifulArray(self, N: int) -> List[int]: if N <= 2:

题目：原题链接（中等）标签：动态规划解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(N2)O(N^2)O(N2)O(N2)O(N^2)O(N2)68ms (56.74%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: _BIG = 10001 def minFallingPathSum(self, A: List[List[int]]) -> int:

题目：原题链接（中等）标签：数组解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(N)O(N)O(N)O(N)O(N)O(N)92ms (41.28%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def minFlipsMonoIncr(self, S: str) -> int: lst1 = [0] for ch in S:

题目：原题链接（中等）标签：数组、双指针解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(N2)O(N^2)O(N2)O(logN)O(logN)O(logN)4404ms (5.19%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: _MOD = 10 ** 9 + 7 def threeSumMulti(self, A: List[int], target:

题目：原题链接（中等）标签：数组解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(N)O(N)O(N)O(1)O(1)O(1)228ms (58.44%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def maxSubarraySumCircular(self, A: List[int]) -> int: ans1 = cur1 = 0

题目：原题链接（中等）标签：数组解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(N)O(N)O(N)O(N)O(N)O(N)212ms (75.44%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def partitionDisjoint(self, A: List[int]) -> int: lst1 = [] lst2 = [

题目：原题链接（中等）标签：排序解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(NlogN)O(NlogN)O(NlogN)O(logN)O(logN)O(logN)52ms (97.02%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def sortArray(self, nums: List[int]) -> List[int]: nums.

题目：原题链接（中等）标签：二分查找解法时间复杂度空间复杂度执行用时Ans 1 (Python)构造 = O(N)O(N)O(N) ; 查询 = O(logN)O(logN)O(logN)O(N)O(N)O(N)740ms (64.29%)Ans 2 (Python)Ans 3 (Python)解法一：class TopVotedCandidate: def __init__(self, persons: List[int], ti

题目：原题链接（中等）标签：贪心算法、数学解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(NlogN)O(NlogN)O(NlogN)O(logN)O(logN)O(logN)196ms (27.84%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def smallestRangeII(self, A: List[int], K: int) -> int:

题目：原题链接（中等）标签：广度优先搜索解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(N)O(N)O(N)O(N)O(N)O(N)108ms (100.00%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def snakesAndLadders(self, board: List[List[int]]) -> int: m, n = len(b

题目：原题链接（中等）标签：数组、双指针、滑动窗口解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(N)O(N)O(N)O(1)O(1)O(1)1160ms (17.70%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def totalFruit(self, tree: List[int]) -> int: ans = 0 l,

题目：原题链接（中等）标签：数组、设计解法时间复杂度空间复杂度执行用时Ans 1 (Python)RLEIterator = O(A)O(A)O(A) ; next = O(N)O(N)O(N)O(A)O(A)O(A)48ms (55.38%)Ans 2 (Python)Ans 3 (Python)解法一：class RLEIterator: def __init__(self, A: List[int]): sel

题目：原题链接（中等）标签：位运算、动态规划解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(NlogN)O(NlogN)O(NlogN)O(NlogN)O(NlogN)O(NlogN)752ms (69.35%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def subarrayBitwiseORs(self, A: List[int]) -> int:

题目：原题链接（中等）标签：图、深度优先搜索、广度优先搜索解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(N)O(N)O(N)O(N)O(N)O(N)152ms (75.80%)Ans 2 (Python)Ans 3 (Python)解法一：def build_graph(edges): graph = collections.defaultdict(set) for edge in edges:

题目：原题链接（中等）标签：数组、数学解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(R×C)O(R×C)O(R×C)O(1)O(1)O(1)116ms (80.00%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def spiralMatrixIII(self, R: int, C: int, r0: int, c0: int) -> List[List[in

题目：原题链接（中等）标签：贪心算法、双指针、数组解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(NlogN)O(NlogN)O(NlogN)O(logN)O(logN)O(logN)108ms (100.00%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def numRescueBoats(self, people: List[int], limit: int)

题目：原题链接（中等）标签：二分查找解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(NlogM)O(NlogM)O(NlogM)O(1)O(1)O(1)552ms (12.77%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def minEatingSpeed(self, piles: List[int], H: int) -> int: lef

题目：原题链接（中等）标签：数组、动态规划解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(N3logN)O(N^3logN)O(N3logN)O(1)O(1)O(1)816ms (38.41%)Ans 2 (Python)Ans 3 (Python)解法一（暴力）：class Solution: def lenLongestFibSubseq(self, A: List[int]) -> int:

题目：原题链接（中等）标签：数组、贪心算法、排序解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(NlogN)O(NlogN)O(NlogN)O(N)O(N)O(N)384ms (84.62%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def advantageCount(self, A: List[int], B: List[int]) -> List[int

题目：原题链接（中等）标签：数学解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(logN)O(logN)O(logN)O(logN)O(logN)O(logN)40ms (79.39%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: _BIG = 10 ** 9 def reorderedPowerOf2(self, N: int) -> bool:

题目：原题链接（中等）标签：数学解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(N)O(N)O(N)O(1)O(1)O(1)204ms (65.71%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: _CHANGE = { "2": 3, "4": 7, "5": 7, "6": 7, "8"

题目：原题链接（中等）标签：数学解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(logN)O(logN)O(logN)O(1)O(1)O(1)40ms (49.40%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def mirrorReflection(self, p: int, q: int) -> int: g = math.gcd(p, q

题目：原题链接（中等）标签：有序映射解法时间复杂度空间复杂度执行用时Ans 1 (Python)seat = O(N)O(N)O(N) ; leave = O(N)O(N)O(N)O(N)O(N)O(N)280ms (72.41%)Ans 2 (Python)Ans 3 (Python)解法一：class ExamRoom: def __init__(self, n: int): self.n = n

题目：原题链接（中等）标签：排序、数组解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(NlogN)O(NlogN)O(NlogN)O(N)O(N)O(N)192ms (84.97%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def carFleet(self, target: int, position: List[int], speed: List[int]) -

题目：原题链接（中等）标签：图、拓扑排序、广度优先搜索、深度优先搜索解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(N)O(N)O(N)O(N)O(N)O(N)484ms (93.42%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def loudAndRich(self, richer: List[List[int]], quiet: List[int]) ->

题目：原题链接（中等）标签：数组、贪心算法、有序映射解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(N)O(N)O(N)O(N)O(N)O(N)124ms (100.00%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def isPossibleDivide(self, nums: List[int], k: int) -> bool: size

题目：原题链接（中等）标签：有序映射解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(N)O(N)O(N)O(N)O(N)O(N)76ms (96.30%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def isNStraightHand(self, hand: List[int], W: int) -> bool: size = len(hand

题目：原题链接（中等）标签：图、广度优先搜索、深度优先搜索解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(N)O(N)O(N)O(N)O(N)O(N)76ms (77.25%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def canVisitAllRooms(self, rooms: List[List[int]]) -> bool: visi

题目：原题链接（中等）标签：动态规划、双指针解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(N)O(N)O(N)O(N)O(N)O(N)192ms (37.89%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def pushDominoes(self, dominoes: str) -> str: dominoes = list(dominoes

题目：原题链接（中等）标签：动态规划解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(min(K+W,N))O(min(K+W,N))O(min(K+W,N))O(K+W)O(K+W)O(K+W)92ms (58.26%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def new21Game(self, N: int, K: int, W: int) -> flo

题目：原题链接（中等）标签：数组解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(N4)O(N^4)O(N4)O(1)O(1)O(1)2312ms (14.12%)Ans 2 (Python)Ans 3 (Python)解法一（极致暴力）：class Solution: def largestOverlap(self, img1: List[List[int]], img2: List[List[int]]) ->

题目：原题链接（中等）标签：二分查找、双指针解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(NlogN+WlogN)O(NlogN+WlogN)O(NlogN+WlogN)O(N)O(N)O(N)388ms (87.74%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def maxProfitAssignment(self, difficulty: List[int]

题目：原题链接（中等）标签：数组、哈希表解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(1212+N)O(121^2+N)O(1212+N)O(121)O(121)O(121)200ms (41.03%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def numFriendRequests(self, ages: List[int]) -> int:

题目：原题链接（中等）标签：动态规划、树解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(N2)O(N^2)O(N2)O(N)O(N)O(N)524ms (35.00%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: _MOD = 10 ** 9 + 7 def numFactoredBinaryTrees(self, A: List[int]) -> in

题目：原题链接（中等）标签：哈希表解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(N)O(N)O(N)O(N)O(N)O(N)140ms (24.62%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def flipgame(self, fronts: List[int], backs: List[int]) -> int: same = {fro

题目：原题链接（中等）标签：字典树、哈希表解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(W×L+WlogW)O(W×L+WlogW)O(W×L+WlogW)O(W×L)O(W×L)O(W×L)96ms (86.49%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def minimumLengthEncoding(self, words: List[str]) -&g

题目：原题链接（中等）标签：数组解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(M×N)O(M×N)O(M×N)O(M×N)O(M×N)O(M×N)76ms (93.28%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def maxIncreaseKeepingSkyline(self, grid: List[List[int]]) -> int:

题目：原题链接（中等）标签：动态规划解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(K×N2)O(K×N^2)O(K×N2)O(N)O(N)O(N)464ms (36.18%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def largestSumOfAverages(self, A: List[int], K: int) -> float: #

题目：原题链接（中等）标签：动态规划、记忆化递归解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(min(N,2002))=O(1)O(min(N,200^2))=O(1)O(min(N,2002))=O(1)O(min(N,2002))O(min(N,200^2))O(min(N,2002))=O(1)36ms (98.92%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution:

题目：原题链接（中等）标签：图、拓扑排序、广度优先搜索、深度优先搜索解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(N+E)O(N+E)O(N+E)O(N+E)O(N+E)O(N+E)180ms (53.74%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def eventualSafeNodes(self, graph1: List[List[int]]) ->

题目：原题链接（中等）标签：动态规划解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(N)O(N)O(N)O(1)O(1)O(1)112ms ()Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def minSwap(self, A: List[int], B: List[int]) -> int: size = len(A) dp =

题目：原题链接（中等）标签：动态规划、记忆化递归解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(N2)O(N^2)O(N2)O(N2)O(N^2)O(N2)144ms (32.52%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def __init__(self): self.total_poured = 0 def champagneTow

题目：原题链接（中等）标签：回溯算法、图、深度优先搜索解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(N!)O(N!)O(N!)O(N!)O(N!)O(N!)47ms (85.53%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def allPathsSourceTarget(self, graph: List[List[int]]) -> List[List[

题目：原题链接（中等）标签：数组、双指针、滑动窗口解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(N)O(N)O(N)O(1)O(1)O(1)324ms (99.45%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def numSubarrayBoundedMax(self, A: List[int], L: int, R: int) -> int:

题目：原题链接（中等）标签：数组、哈希表解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(S+W×L)O(S+W×L)O(S+W×L)O(26×S)O(26×S)O(26×S)1020ms (22.45%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def numMatchingSubseq(self, S: str, words: List[str]) -> i

题目：原题链接（中等）标签：动态规划解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(N)O(N)O(N)O(1)O(1)O(1)40ms (83.33%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: _MOD = 10 ** 9 + 7 def numTilings(self, n: int) -> int: now = [1, 0, 0

题目：原题链接（中等）标签：数学解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(G)O(G)O(G)O(1)O(1)O(1)32ms (95.45%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def escapeGhosts(self, ghosts: List[List[int]], target: List[int]) -> bool: d

题目：原题链接（中等）标签：图、广度优先搜索、深度优先搜索解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(N)O(N)O(N)O(N)O(N)O(N)44ms (85.10%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def isBipartite(self, graph: List[List[int]]) -> bool: size = le

题目：原题链接（中等）标签：数组、数学解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(N)O(N)O(N)O(1)O(1)O(1)372ms (81.98%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def isIdealPermutation(self, A: List[int]) -> bool: n1 = 0 # 局部倒置

题目：原题链接（困难）标签：数组、排序解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(NlogN)O(NlogN)O(NlogN)O(N)O(N)O(N)100ms (37.20%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def maxChunksToSorted(self, arr1: List[int]) -> int: arr2 = l

题目：原题链接（中等）标签：数组解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(N2)O(N^2)O(N2)O(N)O(N)O(N)36ms (80.58%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def maxChunksToSorted(self, arr1: List[int]) -> int: ans = 0 find

题目：原题链接（中等）标签：动态规划解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(N2+M)O(N^2+M)O(N2+M)O(N2)O(N^2)O(N2)4016ms (22.22%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def orderOfLargestPlusSign(self, N: int, mines: List[List[int]]) ->

题目：原题链接（中等）标签：深度优先搜索、位运算解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(7N)O(7^N)O(7N)O(N2)O(N^2)O(N2)56ms (14.49%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def pyramidTransition(self, bottom: str, allowed: List[str]) -> bool:

题目：原题链接（中等）标签：数学解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(N)O(\sqrt{N})O(N​)O(1)O(1)O(1)132ms (29.20%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def reachNumber(self, target: int) -> int: # 1 : [1] # 2 : [

题目：原题链接（中等）标签：广度优先搜索解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(10000)O(10000)O(10000)O(10000)O(10000)O(10000)568ms (76.79%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def openLock(self, dead_ends: List[str], target: str) ->

题目：原题链接（中等）标签：动态规划解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(N)O(N)O(N)O(N)O(N)O(N)56ms (97.08%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def deleteAndEarn(self, nums: List[int]) -> int: if not nums: r

题目：原题链接（中等）标签：数组、有序映射解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(N2)O(N^2)O(N2)O(N)O(N)O(N)380ms (50.66%)Ans 2 (Python)Ans 3 (Python)解法一：class Node: __slots__ = ["start", "end", "left", "right"] def __init__(self, start, end):

题目：原题链接（困难）标签：数组、有序映射、线段树解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(N2logN)O(N^2logN)O(N2logN)O(N)O(N)O(N)1956ms (13.69%)Ans 2 (Python)Ans 3 (Python)解法一：class MyCalendarThree: def __init__(self): self.count = collections.

题目：原题链接（中等）标签：数组、有序映射、线段树解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(N2)O(N^2)O(N2)O(N)O(N)O(N)1412ms (27.85%)Ans 2 (Python)Ans 3 (Python)解法一：class MyCalendarTwo: def __init__(self): self.lst1 = [] self.lst2 = []

题目：原题链接（中等）标签：数组、双指针、滑动窗口解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(N)O(N)O(N)O(1)O(1)O(1)1236ms (47.37%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def numSubarrayProductLessThanK(self, nums: List[int], k: int) -> int:

题目：原题链接（中等）标签：动态规划解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(N×M)O(N×M)O(N×M)O(N×M)O(N×M)O(N×M)676ms (71.56%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def minimumDeleteSum(self, s1: str, s2: str) -> int: dp = [[0]

题目：原题链接（中等）标签：数组、广度优先搜索、深度优先搜索解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(N×M)O(N×M)O(N×M)O(N×M)O(N×M)O(N×M)168ms (36.22%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def maxAreaOfIsland(self, grid: List[List[int]]) -> int:

题目：原题链接（中等）标签：动态规划解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(N2×K)O(N^2×K)O(N2×K)O(N2)O(N^2)O(N2)168ms (73.86%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def knightProbability(self, n: int, k: int, r: int, c: int) -> float

题目：原题链接（中等）标签：字典树解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(N×L)O(N×L)O(N×L)O(N×L)O(N×L)O(N×L)40ms (78.90%)Ans 2 (Python)Ans 3 (Python)解法一：class MapSum: def __init__(self): self.trie = [0, {}] self.count = {}

题目：原题链接（中等）标签：动态规划解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(N2)O(N^2)O(N2)O(N)O(N)O(N)1112ms (49.05%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def findNumberOfLIS(self, nums: List[int]) -> int: size = len(nums)

题目：原题链接（中等）标签：数学解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(1)O(1)O(1)O(1)O(1)O(1)32ms (98.70%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def flipLights(self, n: int, m: int) -> int: if n == 1: return 2

题目：原题链接（中等）标签：数组、数学解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(logN)O(logN)O(logN)O(logN)O(logN)O(logN)52ms (6.21%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def maximumSwap(self, num: int) -> int: num = [int(ch) fo

题目：原题链接（中等）标签：数组、脑筋急转弯解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(N)O(N)O(N)O(1)O(1)O(1)60ms (56.80%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def constructArray(self, n: int, k: int) -> List[int]: ans = [1]

题目：原题链接（中等）标签：二分查找解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(logN+K)O(logN+K)O(logN+K)O(K)O(K)O(K)76ms(45.91%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def findClosestElements(self, arr: List[int], k: int, x: int) -> List

题目：原题链接（中等）标签：动态规划解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(N2)O(N^2)O(N2)O(N)O(N)O(N)96ms (35.73%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def minSteps(self, n: int) -> int: dp = [float("inf")] * (n + 1)

题目：原题链接（中等）标签：动态规划解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(N2)O(N^2)O(N2)O(N)O(N)O(N)2476ms (29.87%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def findLongestChain(self, pairs: List[List[int]]) -> int: pairs.sort

题目：原题链接（中等）标签：数学、字符串解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(N)O(N)O(N)O(N)O(N)O(N)40ms (52.71%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def solveEquation(self, equation: str) -> str: def count(ss):

题目：原题链接（中等）标签：动态规划、深度优先搜索、记忆化递归解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(NS)O(N^S)O(NS)O(N+S)O(N+S)O(N+S)84ms (81.82%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def __init__(self): self.price = [] self.specia

题目：原题链接（中等）标签：数组、二分查找解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(N2logN)O(N^2logN)O(N2logN)O(logN)O(logN)O(logN)712ms (24.14%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def triangleNumber(self, nums: List[int]) -> int:

题目：原题链接（中等）标签：数学、几何解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(1)O(1)O(1)O(1)O(1)O(1)28ms (98.79%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def validSquare(self, p1: List[int], p2: List[int], p3: List[int], p4: List[int]) -&g

题目：原题链接（中等）标签：数学、字符串解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(N)O(N)O(N)O(N)O(N)O(N)40ms (67.37%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def fractionAddition(self, expression: str) -> str: def analyse(ss):

题目：原题链接（中等）标签：动态规划、深度优先搜索解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(M×N×T)O(M×N×T)O(M×N×T)O(M×N×T)O(M×N×T)O(M×N×T)816ms (5.07%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def findPaths(self, m: int, n: int, t: int, ii: int, jj

题目：原题链接（中等）标签：数组、双指针、滑动窗口解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(S1+S2)O(S1+S2)O(S1+S2)O(S1)O(S1)O(S1)100ms (41.36%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def checkInclusion(self, s1: str, s2: str) -> bool:

题目：原题链接（中等）标签：动态规划、数组解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(N)O(N)O(N)O(N)O(N)O(N)172ms (16.33%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def arrayNesting(self, nums: List[int]) -> int: size = len(nums)

题目：原题链接（中等）标签：树、回溯算法、递归解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(N)O(N)O(N)O(logN)O(logN)O(logN)68ms (86.05%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def intersect(self, quadTree1: 'Node', quadTree2: 'Node') -> 'Node':

题目：原题链接（中等）标签：广度优先搜索、深度优先搜索解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(M×N)O(M×N)O(M×N)O(M×N)O(M×N)O(M×N)756ms (49.79%)Ans 2 (Python)Ans 3 (Python)解法一（广度优先搜索）：class Solution: def updateMatrix(self, matrix: List[List[int]]) -> Li

题目：原题链接（中等）标签：二分查找、位运算解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(N)O(N)O(N)O(1)O(1)O(1)48ms (18.94%)Ans 2 (Python)O(logN)O(logN)O(logN)O(1)O(1)O(1)32ms (95.20%)Ans 3 (Python)解法一（位运算）：class Solution: def singleNonDuplicate(self, nu

题目：原题链接（中等）标签：深度优先搜索、广度优先搜索解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(M×N)O(M×N)O(M×N)O(1)O(1)O(1)228ms (36.22%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def updateBoard(self, board: List[List[str]], click: List[int]) ->

题目：原题链接（中等）标签：回溯算法、递归解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(N!)O(N!)O(N!)O(N)O(N)O(N)1804ms (20.71%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def __init__(self): self.N = 0 self.ans = 0 self.now =

题目：原题链接（中等）标签：排序、双指针解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(NlogN+NS)O(NlogN+NS)O(NlogN+NS)O(logN)O(logN)O(logN)632ms (39.11%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def findLongestWord(self, s: str, d: List[str]) ->

题目：原题链接（中等）标签：哈希表、动态规划、数学解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(N)O(N)O(N)O(N)O(N)O(N)56ms (49.54%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def checkSubarraySum(self, nums: List[int], k: int) -> bool: visited

题目：原题链接（中等）标签：动态规划解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(N×C)O(N×C)O(N×C)O(N)O(N)O(N)136ms (86.70%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def change(self, amount: int, coins: List[int]) -> int: dp = [1] + [

题目：原题链接（中等）标签：动态规划解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(N2)O(N^2)O(N2)O(N2)O(N^2)O(N2)1172ms (84.53%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def longestPalindromeSubseq(self, s: str) -> int: size = len(s)

题目：原题链接（中等）标签：数组解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(M×N)O(M×N)O(M×N)O(1)O(1)O(1)208ms (76.56%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def findDiagonalOrder(self, matrix: List[List[int]]) -> List[int]: if

题目：原题链接（中等）标签：数组解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(N)O(N)O(N)O(1)O(1)O(1)284ms (74.87%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def findPoisonedDuration(self, timeSeries: List[int], duration: int) -> int:

题目：原题链接（中等）标签：动态规划、深度优先搜索解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(2N)O(2^N)O(2N)O(2N)O(2^N)O(2N)超出时间限制Ans 2 (Python)O(N×2000)O(N×2000)O(N×2000)O(N×2000)O(N×2000)O(N×2000)220ms (57.52ms)Ans 3 (Python)解法一（回溯算法）：class Solution: def