add skeleton for 1325

fishercoder1534 · fishercoder1534 · commit 0d5a21b05b91 · 2020-02-07T06:56:32.000-08:00
diff --git a/src/main/java/com/fishercoder/solutions/_1325.java b/src/main/java/com/fishercoder/solutions/_1325.java
@@ -0,0 +1,73 @@
+package com.fishercoder.solutions;
+
+import com.fishercoder.common.classes.TreeNode;
+
+/**
+ * 1325. Delete Leaves With a Given Value
+ *
+ * Given a binary tree root and an integer target, delete all the leaf nodes with value target.
+ * Note that once you delete a leaf node with value target, if it's parent node becomes a leaf node and has the value target,
+ * it should also be deleted (you need to continue doing that until you can't).
+ *
+ * Example 1:
+ *        1             1              1
+ *       / \           / \              \
+ *      2  3    ->    2  3    ->         3
+ *     /  / \             \               \
+ *    2   2 4             4               4
+ *
+ * Input: root = [1,2,3,2,null,2,4], target = 2
+ * Output: [1,null,3,null,4]
+ * Explanation: Leaf nodes in green with value (target = 2) are removed (Picture in left).
+ * After removing, new nodes become leaf nodes with value (target = 2) (Picture in center).
+ *
+ * Example 2:
+ *          1          1
+ *         / \        /
+ *        3  3  ->   3
+ *       / \          \
+ *      3  2          2
+ *
+ * Input: root = [1,3,3,3,2], target = 3
+ * Output: [1,3,null,null,2]
+ *
+ * Example 3:
+ *         1              1            1          1
+ *        /              /            /
+ *       2              2            2
+ *      /       ->     /      ->             ->
+ *     2              2
+ *    /
+ *   2
+ *
+ * Input: root = [1,2,null,2,null,2], target = 2
+ * Output: [1]
+ * Explanation: Leaf nodes in green with value (target = 2) are removed at each step.
+ *
+ * Example 4:
+ *          1
+ *         / \    ->
+ *        1  1
+ * Input: root = [1,1,1], target = 1
+ * Output: []
+ *
+ * Example 5:
+ *         1             1
+ *        / \    ->     / \
+ *       2  3          2  3
+ *
+ * Input: root = [1,2,3], target = 1
+ * Output: [1,2,3]
+ *
+ * Constraints:
+ * 1 <= target <= 1000
+ * Each tree has at most 3000 nodes.
+ * Each node's value is between [1, 1000].
+ * */
+public class _1325 {
+    public static class Solution1 {
+        public TreeNode removeLeafNodes(TreeNode root, int target) {
+            return null;
+        }
+    }
+}
