diff --git "a/346円225円260円346円215円256円347円273円223円346円236円204円347円263円273円345円210円227円/344円272円214円345円217円211円346円240円221円346円200円273円347円273円223円.md" "b/346円225円260円346円215円256円347円273円223円346円236円204円347円263円273円345円210円227円/344円272円214円345円217円211円346円240円221円346円200円273円347円273円223円.md"
index 72c219d464..cf0eca0f11 100644
--- "a/346円225円260円346円215円256円347円273円223円346円236円204円347円263円273円345円210円227円/344円272円214円345円217円211円346円240円221円346円200円273円347円273円223円.md"
+++ "b/346円225円260円346円215円256円347円273円223円346円236円204円347円263円273円345円210円227円/344円272円214円345円217円211円346円240円221円346円200円273円347円273円223円.md"
@@ -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)🔒 |
diff --git "a/347円256円227円346円263円225円346円200円235円347円273円264円347円263円273円345円210円227円/345円233円236円346円272円257円347円256円227円346円263円225円350円257円246円350円247円243円344円277円256円350円256円242円347円211円210円.md" "b/347円256円227円346円263円225円346円200円235円347円273円264円347円263円273円345円210円227円/345円233円236円346円272円257円347円256円227円346円263円225円350円257円246円350円247円243円344円277円256円350円256円242円347円211円210円.md"
index 863789ff69..30ed11db6a 100644
--- "a/347円256円227円346円263円225円346円200円235円347円273円264円347円263円273円345円210円227円/345円233円236円346円272円257円347円256円227円346円263円225円350円257円246円350円247円243円344円277円256円350円256円242円347円211円210円.md"
+++ "b/347円256円227円346円263円225円346円200円235円347円273円264円347円263円273円345円210円227円/345円233円236円346円272円257円347円256円227円346円263円225円350円257円246円350円247円243円344円277円256円350円256円242円347円211円210円.md"
@@ -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) |
diff --git "a/351円253円230円351円242円221円351円235円242円350円257円225円347円263円273円345円210円227円/345円255円220円351円233円206円346円216円222円345円210円227円347円273円204円345円220円210円.md" "b/351円253円230円351円242円221円351円235円242円350円257円225円347円263円273円345円210円227円/345円255円220円351円233円206円346円216円222円345円210円227円347円273円204円345円220円210円.md"
index 4c81392902..c4debea1d5 100644
--- "a/351円253円230円351円242円221円351円235円242円350円257円225円347円263円273円345円210円227円/345円255円220円351円233円206円346円216円222円345円210円227円347円273円204円345円220円210円.md"
+++ "b/351円253円230円351円242円221円351円235円242円350円257円225円347円263円273円345円210円227円/345円255円220円351円233円206円346円216円222円345円210円227円347円273円204円345円220円210円.md"
@@ -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) |
</div><div class="naked_ctrl">
<form action="/index.cgi/contrast" method="get" name="gate">
<p><a href="http://altstyle.alfasado.net">AltStyle</a> によって変換されたページ <a href="https://patch-diff.githubusercontent.com/raw/AlgorithmAndLeetCode/labuladong-fucking-algorithm/pull/99.diff">(-&gt;オリジナル)</a>
/ <label>アドレス: <input type="text" name="naked_post_url" value="https://patch-diff.githubusercontent.com/raw/AlgorithmAndLeetCode/labuladong-fucking-algorithm/pull/99.diff" size="22" /></label> <label>モード: <select name="naked_post_mode">
<option value="default">デフォルト</option>
<option value="speech">音声ブラウザ</option>
<option value="ruby">ルビ付き</option>
<option value="contrast" selected="selected">配色反転</option>
<option value="larger-text">文字拡大</option>
<option value="mobile">モバイル</option>
</select>
<input type="submit" value="表示" />
</p>
</form>
</div>