Skip to content

[pull] master from labuladong:master #99

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged

pull merged 1 commit into AlgorithmAndLeetCode:master from labuladong:master

Jun 12, 2023

Merged

[pull] master from labuladong:master #99

Changes from all commits

Commits

Show all changes

Select commit

labuladong Jun 11, 2023

File filter

Filter by extension

Conversations

Jump to

Jump to file

Failed to load files.

Loading

Diff view

Diff view

2 changes: 2 additions & 0 deletions 数据结构系列/二叉树总结.md

Show comments View file Open in desktop

Original file line number	Diff line number	Diff line change
Expand Up		@@ -982,9 +982,11 @@ class Solution {
		\| [2049. Count Nodes With the Highest Score](https://leetcode.com/problems/count-nodes-with-the-highest-score/?show=1) \| [2049. 统计最高分的节点数目](https://leetcode.cn/problems/count-nodes-with-the-highest-score/?show=1) \|
		\| [226. Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree/?show=1) \| [226. 翻转二叉树](https://leetcode.cn/problems/invert-binary-tree/?show=1) \|
		\| [250. Count Univalue Subtrees](https://leetcode.com/problems/count-univalue-subtrees/?show=1)🔒 \| [250. 统计同值子树](https://leetcode.cn/problems/count-univalue-subtrees/?show=1)🔒 \|
	\| [254. Factor Combinations](https://leetcode.com/problems/factor-combinations/?show=1)🔒 \| [254. 因子的组合](https://leetcode.cn/problems/factor-combinations/?show=1)🔒 \|
		\| [257. Binary Tree Paths](https://leetcode.com/problems/binary-tree-paths/?show=1) \| [257. 二叉树的所有路径](https://leetcode.cn/problems/binary-tree-paths/?show=1) \|
		\| [270. Closest Binary Search Tree Value](https://leetcode.com/problems/closest-binary-search-tree-value/?show=1)🔒 \| [270. 最接近的二叉搜索树值](https://leetcode.cn/problems/closest-binary-search-tree-value/?show=1)🔒 \|
		\| [298. Binary Tree Longest Consecutive Sequence](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence/?show=1)🔒 \| [298. 二叉树最长连续序列](https://leetcode.cn/problems/binary-tree-longest-consecutive-sequence/?show=1)🔒 \|
	\| [301. Remove Invalid Parentheses](https://leetcode.com/problems/remove-invalid-parentheses/?show=1) \| [301. 删除无效的括号](https://leetcode.cn/problems/remove-invalid-parentheses/?show=1) \|
		\| [332. Reconstruct Itinerary](https://leetcode.com/problems/reconstruct-itinerary/?show=1) \| [332. 重新安排行程](https://leetcode.cn/problems/reconstruct-itinerary/?show=1) \|
		\| [333. Largest BST Subtree](https://leetcode.com/problems/largest-bst-subtree/?show=1)🔒 \| [333. 最大 BST 子树](https://leetcode.cn/problems/largest-bst-subtree/?show=1)🔒 \|
		\| [366. Find Leaves of Binary Tree](https://leetcode.com/problems/find-leaves-of-binary-tree/?show=1)🔒 \| [366. 寻找二叉树的叶子节点](https://leetcode.cn/problems/find-leaves-of-binary-tree/?show=1)🔒 \|
Expand Down

1 change: 1 addition & 0 deletions 算法思维系列/回溯算法详解修订版.md

Show comments View file Open in desktop

Original file line number	Diff line number	Diff line change
Expand Up		@@ -439,6 +439,7 @@ def backtrack(...):
		\| [140. Word Break II](https://leetcode.com/problems/word-break-ii/?show=1) \| [140. 单词拆分 II](https://leetcode.cn/problems/word-break-ii/?show=1) \|
		\| [17. Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number/?show=1) \| [17. 电话号码的字母组合](https://leetcode.cn/problems/letter-combinations-of-a-phone-number/?show=1) \|
		\| [22. Generate Parentheses](https://leetcode.com/problems/generate-parentheses/?show=1) \| [22. 括号生成](https://leetcode.cn/problems/generate-parentheses/?show=1) \|
	\| [301. Remove Invalid Parentheses](https://leetcode.com/problems/remove-invalid-parentheses/?show=1) \| [301. 删除无效的括号](https://leetcode.cn/problems/remove-invalid-parentheses/?show=1) \|
		\| [332. Reconstruct Itinerary](https://leetcode.com/problems/reconstruct-itinerary/?show=1) \| [332. 重新安排行程](https://leetcode.cn/problems/reconstruct-itinerary/?show=1) \|
		\| [39. Combination Sum](https://leetcode.com/problems/combination-sum/?show=1) \| [39. 组合总和](https://leetcode.cn/problems/combination-sum/?show=1) \|
		\| [698. Partition to K Equal Sum Subsets](https://leetcode.com/problems/partition-to-k-equal-sum-subsets/?show=1) \| [698. 划分为k个相等的子集](https://leetcode.cn/problems/partition-to-k-equal-sum-subsets/?show=1) \|
Expand Down

1 change: 1 addition & 0 deletions 高频面试系列/子集排列组合.md

Show comments View file Open in desktop

Original file line number	Diff line number	Diff line change
Expand Up		@@ -1008,6 +1008,7 @@ void backtrack(int[] nums) {
		\| :----: \| :----: \|
		\| [131. Palindrome Partitioning](https://leetcode.com/problems/palindrome-partitioning/?show=1) \| [131. 分割回文串](https://leetcode.cn/problems/palindrome-partitioning/?show=1) \|
		\| [17. Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number/?show=1) \| [17. 电话号码的字母组合](https://leetcode.cn/problems/letter-combinations-of-a-phone-number/?show=1) \|
	\| [254. Factor Combinations](https://leetcode.com/problems/factor-combinations/?show=1)🔒 \| [254. 因子的组合](https://leetcode.cn/problems/factor-combinations/?show=1)🔒 \|
		\| [368. Largest Divisible Subset](https://leetcode.com/problems/largest-divisible-subset/?show=1) \| [368. 最大整除子集](https://leetcode.cn/problems/largest-divisible-subset/?show=1) \|
		\| [491. Non-decreasing Subsequences](https://leetcode.com/problems/non-decreasing-subsequences/?show=1) \| [491. 递增子序列](https://leetcode.cn/problems/non-decreasing-subsequences/?show=1) \|
		\| - \| [剑指 Offer 38. 字符串的排列](https://leetcode.cn/problems/zi-fu-chuan-de-pai-lie-lcof/?show=1) \|
Expand Down