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 2083fb8 commit 221e1beCopy full SHA for 221e1be
src/main/java/com/fishercoder/solutions/_679.java
@@ -40,7 +40,7 @@ private boolean dfs(double[] nums) {
40
for (int j = 0; j < nums.length; j++) {
41
if (i != j) {
42
int len = 0;
43
- double[] a = new double[nums.length-1];
+ double[] a = new double[nums.length - 1];
44
for (int k = 0; k < nums.length; k++) {
45
if (k != i && k != j) {
46
a[len++] = nums[k];
0 commit comments