We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 356345a commit 2f0f4d2Copy full SHA for 2f0f4d2
problems/78.subsets.md
@@ -39,7 +39,7 @@ https://leetcode-cn.com/problems/subsets/
39
40
## 思路
41
42
-子集和全排列题目不一样的点在于其需要在递归树的所有节点执行**加入结果集*,这一操作,而不像全排列需要在叶子节点执行**加入结果集*。
+子集和全排列题目不一样的点在于其需要在递归树的所有节点执行**加入结果集**,这一操作,而不像全排列需要在叶子节点执行**加入结果集**。
43
44
## 关键点解析
45
0 commit comments