We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 298d86e commit ee319ceCopy full SHA for ee319ce
code/LeetCode/src/backtracking/CombinationSumIII.java
@@ -28,7 +28,7 @@ private void dfs(List<List<Integer>> resultList, List<Integer> list, int k, int
28
resultList.add(new ArrayList<Integer>(list));
29
return;
30
}
31
- if (sum < 0 || start > 9) {
+ if (sum < 0) {
32
33
34
for (int i = start; i <= 9; i++) {
0 commit comments