Skip to content

Conversation

@ThanhNIT
Copy link
Contributor

No description provided.

}
dfs(v2n, v2d, depth + 1, node, child, ans, nums, neighbors);
}

Copy link
Owner

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Please remove empty lines.

countFromLeft--;
countFromRight++;
}

Copy link
Owner

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Please remove empty lines.

prev[i] + mult[row] * nums[n - row + i - 1],
prev[i + 1] + mult[row] * nums[i]);
}

Copy link
Owner

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Please remove empty lines.

@sonarqubecloud
Copy link

@javadev
Copy link
Owner

javadev commented Apr 30, 2022

@javadev javadev merged commit ead1c3d into javadev:main Apr 30, 2022
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

2 participants