2862.Maximum-Element-Sum-of-a-Complete-Subset-of-Indices (H-) 2910.Minimum-Number-of-Groups-to-Create-a-Valid-Assignment (H-) 2939.Maximum-Xor-Product (H-) 2957.Remove-Adjacent-Almost-Equal-Characters (M) 330.P
//Code 1 222 Count Complete Tree Nodes // #222 统计完全二叉树节点个数 描述:如题。 //#222Description: Count Complete Tree Nodes | LeetCode OJ 解法1:可以二分。 // Solution 1: Binary search. 代码1 //Code 1 223 Rectangle Area // #223 矩形面积 描述:给定两个横平竖直的矩形,求总覆盖面积。
Searching algorithms: Backtracking; Recursion; Depth-First-Search (DFS); Breath-First-Search (BFS); Binary Search Tree; etc. Graph theory: Shortest Path Problem; Minimal Spanning Tree Dynamic Programming: Knapsack Problem; Longest Common Subsequence (LCS) Problem The data structures mainly includes: ...
complete-binary-tree-inserter complex-number-multiplication compress-string-lcci concatenated-words concatenation-of-array cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof cong-shang-dao-xia-da-yin-er-cha-shu-lcof cong-wei-dao-tou-da...
laodasbch/Leetcode-Complete-Guide 代码 Issues 0 Pull Requests 0 Wiki 统计 流水线 服务 加入Gitee 与超过 1200万 开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :) 免费加入 已有帐号? 立即登录 该仓库未声明开源许可证文件(LICENSE),使用请关注具体项目描述及其代码上游依赖。 项目仓库所选许...
图论〔Graph Theory〕是数学的一个分支。它以图为研究对象。图论中的图是由若干给定的点及连接两点的线所构成的图形,这种图形通常用来描述某些事物之间的某种特定关系,用点代表事物,用连接两点的线表示相应两个事物间具有这种关系。 基本概念 无向图 & 有向图 有权图 & 无权图 入度& 出度 路径& 环 连通图 ...
2856-count-complete-subarrays-in-an-array 2915-count-of-interesting-subarrays 3348-minimum-cost-walk-in-weighted-graph 3621-minimum-operations-to-make-array-values-equal-to-k 3656-minimum-number-of-operations-to-make-elements-in-array-distinct Math 0007-reverse-integer 0012-integer-to-roman 0048...
N/A Complete Binary Tree.java Easy [BFS, Tree] Java 243 N/A Best Time to Buy and Sell Stock with Transaction Fee.java Medium [Array, DP, Greedy, Sequence DP, Status DP] O(n) O(n), O(1) rolling array Java 244 N/A Pow(x, n).java Medium [Binary Search, Math] Java 245 N/...
0222-count-complete-tree-nodes 0258-add-digits 0279-perfect-squares 0334-increasing-triplet-subsequence 0371-sum-of-two-integers 0374-guess-number-higher-or-lower 0392-is-subsequence 0400-nth-digit 0416-partition-equal-subset-sum 0485-max-consecutive-ones 0554-brick-wall 0605-can-...
2862 Maximum Element-Sum of a Complete Subset of Indices C++ Python O(n) O(n) Hard Number Theory, Basel Problem 2861 Maximum Number of Alloys C++ Python O(k * nlogn) O(n) Medium Binary Search, Sort, Math 2894 Divisible and Non-divisible Sums Difference C++ Python O(1) O(1) Easy ...