Functions — github.com/EndlessCheng/codeforces-go

hub / github.com/EndlessCheng/codeforces-go / functions

Functions8,098 in github.com/EndlessCheng/codeforces-go

⨍ Functions 8,098◇ Types & classes 911

FunctionisSolvable

(words []string, result string)

leetcode/weekly/169/d/d.go:3

FunctionisSubPath

(head *ListNode, t *TreeNode)

leetcode/weekly/178/c/c.go:24

FunctionisSumEqual

github.com/EndlessCheng/codeforces-go

leetcode/weekly/243/a/a.go:4

FunctionisThree

统计因子个数 github.com/EndlessCheng/codeforces-go

leetcode/weekly/252/a/a.go:6

FunctionisTransformable

github.com/EndlessCheng/codeforces-go

leetcode/weekly/206/d/d.go:4

FunctionisValidPalindrome

(s string, k int)

leetcode/biweekly/10/d/d.go:23

FunctionjobScheduling

github.com/EndlessCheng/codeforces-go

leetcode/weekly/159/d/d.go:6

FunctionjosephusProblem

约瑟夫问题思路：用递推公式，自底向上计算 https://zh.wikipedia.org/wiki/%E7%BA%A6%E7%91%9F%E5%A4%AB%E6%96%AF%E9%97%AE%E9%A2%98 https://oi-wiki.org/misc/josephus/ 注意当 k 较小

copypasta/misc.go:775

Functionjudge

github.com/EndlessCheng/codeforces-go

misc/nowcoder/9977/b/b.go:9

FunctionkIncreasing

* 最长上升子序列将 $\textit{arr}$ 每隔 $k$ 个数取一个元素，分为若干组，例如当 $k=3$ 时，分为如下三组： - $arr[0],arr[3],arr[6],\cdots$ - $arr[1],arr[4],arr[7],\cdots$ - $arr[2],arr[5]

leetcode/weekly/272/d/d.go:27

FunctionkLengthApart

(a []int, k int)

leetcode/weekly/187/b/b.go:3

FunctionkMirror

(k, n int)

leetcode/weekly/268/d/d.go:91

FunctionkWeakestRows

(mat [][]int, k int)

leetcode/weekly/174/a/a.go:5

Methodkeys

中序遍历，返回所有键值

copypasta/bst.go:288

FunctionkidsWithCandies

github.com/EndlessCheng/codeforces-go

leetcode/biweekly/25/a/a.go:4

求第 k 小（k 从 0 开始，相当于有 k 个字符串小于返回的字符串 s）此时 o.cnt 保存子树字符串个数

copypasta/trie.go:130

Methodkth

主席树相当于对数组的每个前缀建立一颗线段树离散化时，求 kth 需要将相同元素也视作不同的 EXTRA: 查询区间 [l,r] 中第 k 小在整个数组上的名次（从 1 开始）注意返回的是（排序去重后的数组的）下标，不是元素值初始 t[0] = buildPST(1, len(a)) t[i+1

copypasta/segment_tree.go:627

FunctionkthDistinct

github.com/EndlessCheng/codeforces-go

leetcode/biweekly/64/a/a.go:4

FunctionkthFactor

github.com/EndlessCheng/codeforces-go

leetcode/biweekly/29/b/b.go:6

FunctionkthLargestNumber

Go 自定义排序 github.com/EndlessCheng/codeforces-go

leetcode/weekly/256/b/b.go:8

FunctionkthLargestValue

github.com/EndlessCheng/codeforces-go

leetcode/weekly/225/c/c.go:6

FunctionkthSmallest

(mat [][]int, k int)

leetcode/weekly/187/d/d.go:19

FunctionkthSmallestPath

github.com/EndlessCheng/codeforces-go

leetcode/weekly/213/d/d.go:6

FunctionkthSmallestProduct

* 分类讨论+二分答案先统计分负数乘积个数 $\textit{neg}$、正数乘积个数 $\textit{pos}$ 以及乘积为 $0$ 的个数 $\textit{zero}$，然后分三种情况讨论： - $k\le \textit{neg}$，我们可以二分负数答案，统计不超过二分值的乘积个数；

leetcode/biweekly/63/d/d.go:20

FunctionladderLength

LC 127 双向 BFS

leetcode/main.go:597

FunctionlargestAltitude

github.com/EndlessCheng/codeforces-go

leetcode/biweekly/44/a/a.go:4

FunctionlargestArea

(grid []string)

leetcode/lc-vscode/c/c.go:7

FunctionlargestMagicSquare

github.com/EndlessCheng/codeforces-go

leetcode/biweekly/54/c/c.go:4

FunctionlargestMerge

github.com/EndlessCheng/codeforces-go

leetcode/weekly/227/c/c.go:10

FunctionlargestMergeSA

后缀数组 O(|s|+|t|) 做法

leetcode/weekly/227/c/c.go:33

FunctionlargestMultipleOfThree

(digits []int)

leetcode/weekly/177/d/d.go:5

FunctionlargestNumber

github.com/EndlessCheng/codeforces-go

leetcode/biweekly/26/d/d.go:4

FunctionlargestOddNumber

* 由于奇数的最后一个数字是奇数，从后往前找到第一个奇数数字，删掉后面的字符串，剩下的就是最大的奇数 */ github.com/EndlessCheng/codeforces-go

leetcode/weekly/246/a/a.go:8

FunctionlargestPathValue

github.com/EndlessCheng/codeforces-go

leetcode/weekly/240/d/d.go:4

FunctionlargestSubmatrix

github.com/EndlessCheng/codeforces-go

leetcode/weekly/224/c/c.go:6

FunctionlargestUniqueNumber

github.com/EndlessCheng/codeforces-go

leetcode/biweekly/5/a/a.go:4

FunctionlastSubstring

(s string)

leetcode/weekly/150/d/d.go:9

FunctionlatestDayToCross

(row, col int, cells [][]int)

leetcode/weekly/254/d/d.go:6

MethodlcaBinarySearch

点分树（动态点分治） todo https://oi-wiki.org/graph/dynamic-tree-divide/ todo 模板题 https://www.luogu.com.cn/problem/P6329 最近公共祖先 · 其一 · 基于树上倍增和二分搜索 O(nlogn) 预处理，

copypasta/graph_tree.go:659

MethodlcaRMQ

最近公共祖先 · 其二 · 基于 RMQ O(nlogn) 预处理，O(1) 查询由于预处理 ST 表是基于一个长度为 2n 的序列，所以常数上是比倍增算法要大的。内存占用也比倍增要大一倍左右（这点可忽略）优点是查询的复杂度低，适用于查询量大的情形 https://oi-wiki.org/gra

copypasta/graph_tree.go:832

MethodlcaTarjan

最近公共祖先 · 其三 · Tarjan 离线算法时间和空间复杂度均为 O(n+q) 虽然用了并查集但是由于数据的特殊性，操作的均摊结果是 O(1) 的，见 https://core.ac.uk/download/pdf/82125836.pdf https://oi-wiki.org/graph

copypasta/graph_tree.go:899

FunctionleastInterval

LC 621 任务调度器

leetcode/main.go:1382

FunctionleastMinutes

github.com/EndlessCheng/codeforces-go

leetcode/lc-vscode/a/a.go:6

Methodlen

()

misc/atcoder/abc168/c/c.go:19

Methodlen2

()

copypasta/geometry.go:1107

Methodless

(b vecF)

copypasta/geometry.go:188

Methodless

(b vec3)

copypasta/geometry.go:1075

MethodlexicographicallySmallestShortestPath

字典序最小最短路入门经典第二版 p.173 理想路径（NEERC10）https://codeforces.com/gym/101309 I 题从终点倒着 BFS 求最短路，然后从起点开始一层一层向终点走，每一步都选颜色最小的，并记录最小颜色对应的所有节点，供下一层遍历如果求的是字典序最小的顶

copypasta/graph.go:414

MethodlimitDegreeMST

单点度数（单度）限制最小生成树 O(n^2) 点 root 的度数不超过 lim 不超过 http://poj.org/problem?id=1639 https://codeforces.com/gym/100227 A https://www.acwing.com/problem/conte

copypasta/graph.go:1606

MethodlimitSizeDecomposition

树分块 https://oi-wiki.org/ds/tree-decompose/ https://ouuan.github.io/post/%E8%8E%AB%E9%98%9F%E5%B8%A6%E4%BF%AE%E8%8E%AB%E9%98%9F%E6%A0%91%E4%B8%8A%E8%8E

copypasta/graph_tree.go:1355

FunctionlineIO

如果输入按照行来读入更方便的话…… 数据个数未知 https://www.luogu.com.cn/problem/P2762 仅加速用 https://codeforces.com/problemset/problem/375/B 注意由于 buffer 的缘故，bufio.Scanner 不要和

copypasta/io.go:237

Functionlogin

(username, password string)

copypasta/template/atcoder/generator.go:80

FunctionlongestAwesome

github.com/EndlessCheng/codeforces-go

leetcode/biweekly/32/d/d.go:4

FunctionlongestBeautifulSubstring

github.com/EndlessCheng/codeforces-go

leetcode/weekly/238/c/c.go:4

FunctionlongestCommonSubpath

github.com/EndlessCheng/codeforces-go

leetcode/weekly/248/d/d.go:11

FunctionlongestDiverseString

(a, b, c int)

leetcode/weekly/183/c/c.go:8

FunctionlongestDiverseString2

(a int, b int, c int)

leetcode/weekly/183/c/c.go:41

FunctionlongestNiceSubstring

github.com/EndlessCheng/codeforces-go

leetcode/biweekly/46/a/a.go:4

FunctionlongestObstacleCourseAtEachPosition

github.com/EndlessCheng/codeforces-go

leetcode/weekly/253/d/d.go:6

FunctionlongestPalindrome

(S, T string)

leetcode/weekly/229/d/d.go:41

FunctionlongestPrefix

(s string)

leetcode/weekly/181/d/d.go:3

FunctionlongestSubarray

github.com/EndlessCheng/codeforces-go

leetcode/biweekly/29/c/c.go:6

FunctionlongestSubarray

(a []int, limit int)

leetcode/weekly/187/c/c.go:64

FunctionlongestSubsequenceRepeatedK

* 根据题意，答案长度不会超过 $\lceil\dfrac{n}{k}\rceil$，而 $n<8k$，故答案长度不超过 $7$。我们可以统计出 $s$ 中个数不低于 $k$ 的字符，答案只能由这些字符注册，而这些字符的个数不会超过 $\lceil\dfrac{n}{k}\rceil$，由于

leetcode/weekly/259/d/d.go:14

FunctionlongestWord

LC 1858

leetcode/main.go:1698

FunctionlongestZigZag

github.com/EndlessCheng/codeforces-go

leetcode/biweekly/21/c/c.go:6

FunctionloopCollection

* 枚举枚举所有 2^n 子集枚举子集的所有子集枚举大小为 k 的子集枚举格点周围（曼哈顿距离、切比雪夫距离） */

copypasta/search.go:674

FunctionlowerArgsFirstChar

(funcDefineLine string)

copypasta/template/leetcode/helper.go:58

MethodlowerCount

>= key 的元素个数等价于 t.root.size() - t.mRank(key)

copypasta/bst.go:237

FunctionlowestCommonAncestor

LC 235

leetcode/main.go:1045

FunctionluckyNumbers

(a [][]int)

leetcode/weekly/180/a/a.go:3

kth: 排名为 k 的节点 o（即有 k 个键小于 o.key）维护子树和的写法见 https://codeforces.com/contest/1398/submission/119651187

copypasta/bst.go:255

Functionmain

()

main/edu/2/suffixarray/step5/a/main.go:37

Functionmain

()

main/edu/2/suffixarray/step5/d/main.go:108

Functionmain

()

main/edu/2/suffixarray/step5/f/main.go:84

Functionmain

()

main/edu/2/suffixarray/step5/e/main.go:83

Functionmain

()

main/edu/2/suffixarray/step5/c/main.go:89

Functionmain

()

main/edu/2/suffixarray/step5/b/main.go:44

Functionmain

()

main/edu/2/disjointset/step3/a/main.go:68

Functionmain

()

main/edu/2/disjointset/step3/c/main.go:116

Functionmain

()

main/edu/2/disjointset/step3/b/main.go:101

Functionmain

()

main/edu/2/disjointset/step1/a/main.go:41

Functionmain

()

main/edu/2/disjointset/step1/d/main.go:61

Functionmain

()

main/edu/2/disjointset/step1/e/main.go:77

Functionmain

()

main/edu/2/disjointset/step1/c/main.go:57

Functionmain

()

main/edu/2/disjointset/step1/b/main.go:58

Functionmain

()

main/edu/2/disjointset/step2/g/main.go:44

Functionmain

()

main/edu/2/disjointset/step2/a/main.go:44

Functionmain

()

main/edu/2/disjointset/step2/d/main.go:47

Functionmain

()

main/edu/2/disjointset/step2/f/main.go:64

Functionmain

()

main/edu/2/disjointset/step2/e/main.go:48

Functionmain

()

main/edu/2/disjointset/step2/j/main.go:47

Functionmain

()

main/edu/2/disjointset/step2/c/main.go:49

Functionmain

()

main/edu/2/disjointset/step2/b/main.go:40

Functionmain

()

main/edu/2/disjointset/step2/i/main.go:57

Functionmain

()

main/edu/2/disjointset/step2/h/main.go:56

Functionmain

()

main/edu/2/segmenttree2/step3/a/main.go:91

Functionmain

()

main/edu/2/segmenttree2/step3/c/main.go:98

← previous next →6,901–7,000 of 8,098, ranked by callers