We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 31d00c9 commit 23fcf68Copy full SHA for 23fcf68
C++/count-subtrees-with-max-distance-between-cities.cpp
@@ -57,7 +57,7 @@ class Solution {
57
}
58
59
60
- (*count)[curr] += (*count)[child]; // merge child to count subtrees
+ (*count)[curr] += (*count)[child]; // merge new child
61
(*dp)[curr] = move(new_dp_curr);
62
63
0 commit comments