add 1273

Author: luliyucoordinate

README.md

@@ -574,4 +574,5 @@ LeetCode
 |1268|[Search Suggestions System](https://leetcode.com/problems/search-suggestions-system/)|c|[c++](./src/1268-Search-Suggestions-System/1268.cpp)|[python](./src/1268-Search-Suggestions-System/1268.py)|[go](./src/1268-Search-Suggestions-System/1268.go)|[js](./src/1268-Search-Suggestions-System/1268.js)|[java](./src/1268-Search-Suggestions-System/1268.java)|Medium|
 |1269|[Number of Ways to Stay in the Same Place After Some Steps](https://leetcode.com/problems/number-of-ways-to-stay-in-the-same-place-after-some-steps/)|c|[c++](./src/1269-Number-of-Ways-to-Stay-in-the-Same-Place-After-Some-Steps/1269.cpp)|[python](./src/1269-Number-of-Ways-to-Stay-in-the-Same-Place-After-Some-Steps/1269.py)|[go](./src/1269-Number-of-Ways-to-Stay-in-the-Same-Place-After-Some-Steps/1269.go)|[js](./src/1269-Number-of-Ways-to-Stay-in-the-Same-Place-After-Some-Steps/1269.js)|[java](./src/1269-Number-of-Ways-to-Stay-in-the-Same-Place-After-Some-Steps/1269.java)|Hard|
 |1271|[Hexspeak](https://leetcode.com/contest/biweekly-contest-14/problems/hexspeak/)|c|[c++](./src/1271-Hexspeak/1271.cpp)|[python](./src/1271-Hexspeak/1271.py)|[go](./src/1271-Hexspeak/1271.go)|[js](./src/1271-Hexspeak/1271.js)|[java](./src/1271-Hexspeak/1271.java)|Easy|
-|1272|[Remove Interval](https://leetcode.com/contest/biweekly-contest-14/problems/remove-interval/)|c|[c++](./src/1272-Remove-Interval/1272.cpp)|[python](./src/1272-Remove-Interval/1272.py)|[go](./src/1272-Remove-Interval/1272.go)|[js](./src/1272-Remove-Interval/1272.js)|[java](./src/1272-Remove-Interval/1272.java)|Medium|
+|1272|[Remove Interval](https://leetcode.com/contest/biweekly-contest-14/problems/remove-interval/)|c|[c++](./src/1272-Remove-Interval/1272.cpp)|[python](./src/1272-Remove-Interval/1272.py)|[go](./src/1272-Remove-Interval/1272.go)|[js](./src/1272-Remove-Interval/1272.js)|[java](./src/1272-Remove-Interval/1272.java)|Medium|
+|1273|[Delete Tree Nodes](https://leetcode.com/contest/biweekly-contest-14/problems/delete-tree-nodes/)|c|[c++](./src/1273-Delete-Tree-Nodes/1273.cpp)|[python](./src/1273-Delete-Tree-Nodes/1273.py)|[go](./src/1273-Delete-Tree-Nodes/1273.go)|[js](./src/1273-Delete-Tree-Nodes/1273.js)|[java](./src/1273-Delete-Tree-Nodes/1273.java)|Medium|

src/1273-Delete-Tree-Nodes/1273.cpp

@@ -0,0 +1,18 @@
+class Solution 
+{
+public:
+    int deleteTreeNodes(int n, vector<int>& parent, vector<int>& value) 
+    {
+        for (int i = n - 1; i > 0; i--) value[parent[i]] += value[i];
+        int zeros = 0;
+        bool isZero[n] = {};
+        for (int i = 0; i < n; i++)
+        {
+            if (parent[i] > 0 && isZero[parent[i]] || value[i] == 0)
+            {
+                isZero[i] = true; zeros++;
+            }
+        }
+        return n - zeros;
+    }
+};

src/1273-Delete-Tree-Nodes/1273.go

@@ -0,0 +1,15 @@
+func deleteTreeNodes(n int, parent []int, value []int) int {
+    for i := n - 1; i > 0; i-- {
+        value[parent[i]] += value[i]
+    }
+    
+    zeros := 0
+    isZero := make([]bool, n)
+    for i := 0; i < n; i++ {
+        if parent[i] > 0 && isZero[parent[i]] || value[i] == 0 {
+            isZero[i] = true
+            zeros++
+        }
+    }
+    return n - zeros
+}

src/1273-Delete-Tree-Nodes/1273.java

@@ -0,0 +1,16 @@
+class Solution {
+    public int deleteTreeNodes(int n, int[] parent, int[] value) {
+        for(int i = n - 1; i > 0; i--) {
+            value[parent[i]] += value[i];
+        }
+        int zeros = 0;
+        boolean[] isZero = new boolean[n];
+        for(int i = 0; i < n; i++) {
+            if(parent[i] > 0 && isZero[parent[i]] || value[i] == 0) {
+                isZero[i] = true;
+                zeros++;
+            }
+        }
+        return n - zeros;
+    }
+}

src/1273-Delete-Tree-Nodes/1273.js

@@ -0,0 +1,15 @@
+var deleteTreeNodes = function(n, parent, value) {
+    for (let i = n - 1; i > 0; i--) {
+        value[parent[i]] += value[i];
+    }
+    
+    let zeros = 0, isZero = new Array(n);
+    isZero.fill(0);
+    for (let i = 0; i < n; i++) {
+        if (parent[i] > 0 && isZero[parent[i]] || value[i] == 0) {
+            isZero[i] = 1;
+            zeros++;
+        }
+    }
+    return n - zeros;
+};

src/1273-Delete-Tree-Nodes/1273.py

@@ -0,0 +1,11 @@
+class Solution:
+    def deleteTreeNodes(self, n: int, parent: List[int], value: List[int]) -> int:
+        for i in range(n-1, 0, -1):
+            value[parent[i]] += value[i]
+        
+        zeros, isZero = 0, [0] * n
+        for i in range(n):
+            if parent[i] > 0 and isZero[parent[i]] or value[i] == 0:
+                isZero[i] = 1
+                zeros += 1
+        return n - zeros

src/addProb.py

@@ -2,9 +2,9 @@
 import os, bisect
 
 # 题目名称
-name = "Remove Interval"
-ID = 1272
-url = "https://leetcode.com/contest/biweekly-contest-14/problems/remove-interval/"
+name = "Delete Tree Nodes"
+ID = 1273
+url = "https://leetcode.com/contest/biweekly-contest-14/problems/delete-tree-nodes/"
 difficult = "Medium"
 prog = ['c', 'cpp', 'py', 'go', 'js', 'java']