Update maximum-score-after-applying-operations-on-a-tree.cpp

kamyu104 · web-flow · commit cf586be9e429 · 2023-11-06T13:35:49.000+08:00
diff --git a/C++/maximum-score-after-applying-operations-on-a-tree.cpp b/C++/maximum-score-after-applying-operations-on-a-tree.cpp
@@ -16,7 +16,7 @@ class Solution {
             while (!empty(stk)) {
                 const auto [step, u, p] = stk.back(); stk.pop_back(); 
                 if (step == 1) {
-                    if (u && size(adj[u]) == 1) {
+                    if (size(adj[u]) == (u ? 1 : 0)) {
                         dp[u] = static_cast<int64_t>(values[u]);
                         continue;
                     }
@@ -55,7 +55,7 @@ class Solution2 {
             adj[e[1]].emplace_back(e[0]);
         }
         const function<int64_t (int, int)> dfs = [&](int u, int p) {
-            if (u && size(adj[u]) == 1) {
+            if (size(adj[u]) == (u ? 1 : 0)) {
                 return static_cast<int64_t>(values[u]);
             }
             int64_t total = 0;

Original file line number	Diff line number	Diff line change
`@@ -16,7 +16,7 @@ class Solution {`
`16`	`16`	`while (!empty(stk)) {`
`17`	`17`	`const auto [step, u, p] = stk.back(); stk.pop_back();`
`18`	`18`	`if (step == 1) {`
`19`		`- if (u && size(adj[u]) == 1) {`
	`19`	`+ if (size(adj[u]) == (u ? 1 : 0)) {`
`20`	`20`	`dp[u] = static_cast<int64_t>(values[u]);`
`21`	`21`	`continue;`
`22`	`22`	`}`
`@@ -55,7 +55,7 @@ class Solution2 {`
`55`	`55`	`adj[e[1]].emplace_back(e[0]);`
`56`	`56`	`}`
`57`	`57`	`const function<int64_t (int, int)> dfs = [&](int u, int p) {`
`58`		`- if (u && size(adj[u]) == 1) {`
	`58`	`+ if (size(adj[u]) == (u ? 1 : 0)) {`
`59`	`59`	`return static_cast<int64_t>(values[u]);`
`60`	`60`	`}`
`61`	`61`	`int64_t total = 0;`