From 4e0ce852627baf8df6e4ef69976ee31bce2fbca9 Mon Sep 17 00:00:00 2001
From: Matej Focko <me@mfocko.xyz>
Date: Thu, 18 Jul 2024 18:41:53 +0200
Subject: [PATCH] =?UTF-8?q?java:=20add=20=C2=AB1530.=20Number=20of=20Good?=
 =?UTF-8?q?=20Leaf=20Nodes=20Pairs=C2=BB?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

Signed-off-by: Matej Focko <me@mfocko.xyz>
---
 java/number-of-good-leaf-nodes-pairs.java | 58 +++++++++++++++++++++++
 1 file changed, 58 insertions(+)
 create mode 100644 java/number-of-good-leaf-nodes-pairs.java

diff --git a/java/number-of-good-leaf-nodes-pairs.java b/java/number-of-good-leaf-nodes-pairs.java
new file mode 100644
index 0000000..d958075
--- /dev/null
+++ b/java/number-of-good-leaf-nodes-pairs.java
@@ -0,0 +1,58 @@
+class Solution {
+  private record Result(int[] reachable, int pairs) {
+    public Result(int[] reachable) {
+      this(reachable, 0);
+    }
+
+    public static Result deadEnd(int distance) {
+      return new Result(new int[distance + 1]);
+    }
+
+    public static Result leaf(int distance) {
+      int[] reachable = new int[distance + 1];
+      reachable[0] = 1;
+      return new Result(reachable);
+    }
+
+    public static Result merge(int distance, Result left, Result right) {
+      int[] merged = new int[distance + 1];
+
+      // we're moving by one
+      for (int i = 0; i < distance; ++i) {
+        merged[i + 1] += left.reachable[i] + right.reachable[i];
+      }
+
+      int pairs = left.pairs + right.pairs;
+      for (int i = 0; i <= distance; ++i) {
+        for (int j = 0; j <= distance; ++j) {
+          if (i + j + 2 <= distance) {
+            pairs += left.reachable[i] * right.reachable[j];
+          }
+        }
+      }
+
+      return new Result(merged, pairs);
+    }
+  }
+
+  private boolean isLeaf(TreeNode node) {
+    return node.left == null && node.right == null;
+  }
+
+  private Result traverse(TreeNode node, int distance) {
+    if (node == null) {
+      return Result.deadEnd(distance);
+    } else if (isLeaf(node)) {
+      return Result.leaf(distance);
+    }
+
+    var left = traverse(node.left, distance);
+    var right = traverse(node.right, distance);
+
+    return Result.merge(distance, left, right);
+  }
+
+  public int countPairs(TreeNode root, int distance) {
+    return traverse(root, distance).pairs;
+  }
+}