add comments for 1273

fishercoder1534 · fishercoder1534 · commit 98a45407e9ec · 2020-02-11T15:38:27.000-08:00
diff --git a/src/main/java/com/fishercoder/solutions/_1273.java b/src/main/java/com/fishercoder/solutions/_1273.java
@@ -38,8 +38,10 @@ public int deleteTreeNodes(int nodes, int[] parent, int[] value) {
                 while (i > 0 && parent[i] == parentIndex) {
                     sum += value[i--];
                 }
+                //we'll reset the value to be the newly computed sum of this node and all of its children
                 value[parentIndex] = value[parentIndex] + sum;
             }
+            //then we'll reset this node's children to be zero if this node's computed sum is zero
             for (int i = 0; i < value.length; i++) {
                 if (value[i] == 0) {
                     for (int j = 0; j < parent.length; j++) {

Original file line number	Diff line number	Diff line change
`@@ -38,8 +38,10 @@ public int deleteTreeNodes(int nodes, int[] parent, int[] value) {`
`38`	`38`	`while (i > 0 && parent[i] == parentIndex) {`
`39`	`39`	`sum += value[i--];`
`40`	`40`	`}`
	`41`	`+ //we'll reset the value to be the newly computed sum of this node and all of its children`
`41`	`42`	`value[parentIndex] = value[parentIndex] + sum;`
`42`	`43`	`}`
	`44`	`+ //then we'll reset this node's children to be zero if this node's computed sum is zero`
`43`	`45`	`for (int i = 0; i < value.length; i++) {`
`44`	`46`	`if (value[i] == 0) {`
`45`	`47`	`for (int j = 0; j < parent.length; j++) {`