Math
标题
列 1
列 2
列 3
列 4
列 5
列 6
列 7
Title
Solution
Time
Space
Difficulty
Tag
Note
O(logn)
O(1)
Medium
O(n^2)
O(n)
Medium
Cantor Ordering
O(n)
O(1)
Hard
Automata
O(2^n)
O(1)
Medium
O(1)
O(1)
Hard
CTCI, LintCode
O(1)
O(1)
Easy
LintCode
O(logn)
O(1)
Medium
Tricky, DP
O(logn)
O(1)
Medium
Bézout's identity
O(n)
O(1)
Medium
ctor: O(n)getRandom: O(1)
O(n)
Medium
Reservoir Sampling
ctor: O(n)pick: O(1)
O(n)
Medium
Reservoir Sampling, Hash Table
O(logn)
O(1)
Easy
O(nlogn)
O(1)
Easy
Binary Search
O(n)
O(1)
Medium
🔒
O(logn * log(logn))
O(1)
Hard
Math
O(n1)
O(1)
Easy
Math
O(sqrt(n))
O(1)
Easy
Math
ctor: O(1) pick: O(1) reset: O(n)
O(n)
Medium
ctor: O(n) pick: O(logn)
O(n)
Medium
O(sqrt(c) * logc)
O(1)
Easy
O(1)
O(1)
Medium
🔒
Math, DP
O(logn)
O(1)
Hard
🔒
O(logn)
O(1)
Medium
O(log(max(m, n)))
O(1)
Hard
O(sqrt(n))
O(1)
Hard
Factorization
O(n^(1/2) * (logn + n^(1/2)))
O(logn)
Medium
O(n^0.25 * logn)
O(logn)
Hard
O(n)
O(n)
Medium
Mono Stack
O(n^2) ~ O(n^3)
O(n^2)
Medium
O((logn)^2)
O(r)
Easy
Loading...
ran2323
ran2323
忘掉名字吧
Latest posts
SFT + DPO 塔罗解读
2025-4-14
Backtracking
2025-4-14
Leetcode 0001-1000 分组
2025-4-14
mcp 记录(1)
2025-4-14
DPO 相关
2025-3-29
今日paper(3/25) - MAGPIE
2025-3-27
Announcement
 
 
 
 
暂时没有新的内容