docs: update

brightzoe · Apr 9, 2024 · ab3f01d · ab3f01d
1 parent f846f12
commit ab3f01d
Show file tree

Hide file tree

Showing 2 changed files with 1 addition and 122 deletions.
diff --git a/blog/2021-12-27-year-end-summary-of-2021.md b/blog/2021-12-27-year-end-summary-of-2021.md
diff --git a/docs/algorithm/backtracking.md b/docs/algorithm/backtracking.md
@@ -79,7 +79,7 @@ console.log(permute([1, 2, 3]));
 [78. 子集 - 力扣（LeetCode）](https://leetcode.cn/problems/subsets/description/)⭐⭐⭐✨
 
 - 组合问题。递归与回溯。
-- 深度优先遍历。寻找变与不变。变的是每个组合的长度，不变的是可以选择的元素。所以
+- 深度优先遍历。寻找变与不变。变的是每个组合的长度，不变的是可以选择的元素。
 
 ```ts
 function subsets(nums: number[]): number[][] {