《代码随想录》LeetCode 刷题攻略：200道经典题目刷题顺序，共60w字的详细图解，视频难点剖析，50余张思维导图，支持C++，Java，Python，Go，JavaScript等多语言版本，从此算法学习不再迷茫！🔥🔥 来看看，你会发现相见恨晚！🚀
24 matches across 3 categories. Click a row to expand file-level details.
| Severity | File | Line | Snippet |
|---|---|---|---|
| HIGH | problems/0104.二叉树的最大深度.md | 0 | # definition for a node. class node: def __init__(self, val=none, children=none): self.val = val self.children = childre |
| HIGH | problems/0104.二叉树的最大深度.md | 0 | # definition for a node. class node: def __init__(self, val=none, children=none): self.val = val self.children = childre |
| HIGH | problems/0102.二叉树的层序遍历.md | 0 | # definition for a node. class node: def __init__(self, val=none, children=none): self.val = val self.children = childre |
| Severity | File | Line | Snippet |
|---|---|---|---|
| LOW | problems/二叉树的递归遍历.md | 281 | } |
| LOW | problems/二叉树的递归遍历.md | 321 | // let res=[]; |
| LOW | problems/二叉树的递归遍历.md | 341 | ...inorderTraversal(root.right), |
| LOW | problems/0203.移除链表元素.md | 621 | } |
| LOW | problems/toolgithub.sh | 1 | ######################################################################### |
| LOW | problems/toolgithub.sh | 41 | ex -sc '1i|* [刷算法（两个月高强度学算法）](https://www.programmercarl.com/xunlian/xunlianying.html)' -cx $i |
| LOW | problems/0494.目标和.md | 841 | // 将所有元素划分为 2 个集合, |
| LOW | problems/0494.目标和.md | 861 | } |
| LOW | problems/0101.对称二叉树.md | 341 | continue; |
| LOW | problems/0005.最长回文子串.md | 521 | //Manacher算法,利用回文对称的性质，根据i在上一个回文中心的臂长里的位置去判断i的回文性 |
| LOW | problems/0005.最长回文子串.md | 541 | //1.i>maxRight,找不到i',无法参考，自己算自己的 |
| LOW | problems/0968.监控二叉树.md | 241 | // left == 1 && right == 0 左节点有摄像头，右节点无覆盖 |
| LOW | problems/0968.监控二叉树.md | 481 | # 情况1: 左右节点都有覆盖 |
| LOW | problems/kamacoder/0126.骑士的攻击astar.md | 581 | ### TypeScript |
| Severity | File | Line | Snippet |
|---|---|---|---|
| LOW | problems/0654.最大二叉树.md | 399 | function constructMaximumBinaryTree(nums: number[]): TreeNode | null { |
| LOW | problems/0654.最大二叉树.md | 419 | function constructMaximumBinaryTree(nums: number[]): TreeNode | null { |
| LOW | problems/1365.有多少小于当前数字的数字.md | 259 | function smallerNumbersThanCurrent(nums: number[]): number[] { |
| LOW | problems/1365.有多少小于当前数字的数字.md | 278 | function smallerNumbersThanCurrent(nums: number[]): number[] { |
| LOW | problems/1005.K次取反后最大化的数组和.md | 311 | function largestSumAfterKNegations(nums: number[], k: number): number { |
| LOW | problems/kamacoder/0109.冗余连接II.md | 409 | def is_tree_after_remove_edge(edges, edge, n): |
| LOW | problems/kamacoder/0104.建造最大岛屿.md | 420 | def check_largest_connect_island(self,grid): |