feat: add 375. Guess Number Higher or Lower II

Author: nphausg

README.md

@@ -54,6 +54,7 @@ Medium: https://medium.com/@nphausg
 | [0242. Valid Anagram](https://leetcode.com/problems/valid-anagram)                                                                                   | [Solution](src/com/nphausg/leetcode/easy/ValidAnagram.java)                                    | [Solution](src/com/nphausg/leetcode/easy/ValidAnagramKt.kt)                  | -                                                                                                                                 |
 | [0268. Missing Number](https://leetcode.com/problems/missing-number)                                                                                 | [Solution](src/com/nphausg/leetcode/easy/MissingNumber.java)                                   | [Solution](src/com/nphausg/leetcode/easy/MissingNumberKt.kt)                 | [Medium](https://nphausg.medium.com/leetcode-0268-missing-number-a-deep-dive-into-efficient-solutions-with-java-91d3f983defc)     |
 | [0374. Guess Number Higher or Lower](https://leetcode.com/problems/guess-number-higher-or-lower)                                                     | [Solution](src/com/nphausg/leetcode/easy/GuessNumberHigherOrLower.java)                        | [Solution](src/com/nphausg/leetcode/easy/GuessNumberHigherOrLowerKt.kt)      | -                                                                                                                                 |
+| [0375. Guess Number Higher or Lower II](https://leetcode.com/problems/guess-number-higher-or-lower-ii)                                                     | [Solution](src/com/nphausg/leetcode/medium/GuessNumberHigherOrLowerII.java)                    | [Solution](src/com/nphausg/leetcode/medium/GuessNumberHigherOrLowerIIKt.kt)      | -                                                                                                                                 |
 | [0387. First Unique Character in a String](https://leetcode.com/problems/first-unique-character-in-a-string)                                         | [Solution](src/com/nphausg/leetcode/easy/FirstUniqueCharacterInAString.java)                   | [Solution](src/com/nphausg/leetcode/easy/FirstUniqueCharacterInAStringKt.kt) | [Medium](https://nphausg.medium.com/leetcode-387-first-unique-character-22bf7752c35e)                                             |
 | [0389. Find the Difference](https://leetcode.com/problems/find-the-difference)                                                                       | [Solution](src/com/nphausg/leetcode/easy/FindTheDifference.java)                               | -                                                                            | [Medium](https://levelup.gitconnected.com/leetcode-389-find-the-difference-exploring-all-solutions-can-be-with-java-a2be916767a0) |
 | [0409. Longest Palindrome](https://leetcode.com/problems/longest-palindrome)                                                                         | [Solution](src/com/nphausg/leetcode/easy/LongestPalindrome.java)                               | -                                                                            | -                                                                                                                                 |

src/com/nphausg/leetcode/medium/GuessNumberHigherOrLowerII.java

@@ -0,0 +1,48 @@
+package com.nphausg.leetcode.medium;
+
+import java.util.Arrays;
+
+/**
+ * <a href="https://leetcode.com/problems/guess-number-higher-or-lower-ii">375. Guess Number Higher or Lower II/a>
+ */
+public class GuessNumberHigherOrLowerII {
+
+    public int topDownGetMoneyAmount(int n) {
+        int[][] mem = new int[n + 1][n + 1];
+        Arrays.stream(mem).forEach(A -> Arrays.fill(A, Integer.MAX_VALUE));
+        return getMoneyAmount(1, n, mem);
+    }
+
+    private int getMoneyAmount(int i, int j, int[][] mem) {
+        if (i >= j)
+            return 0;
+        if (mem[i][j] != Integer.MAX_VALUE)
+            return mem[i][j];
+
+        for (int k = i; k <= j; ++k)
+            mem[i][j] = Math.min(
+                    mem[i][j],
+                    Math.max(
+                            getMoneyAmount(i, k - 1, mem),
+                            getMoneyAmount(k + 1, j, mem)
+                    ) + k
+            );
+
+        return mem[i][j];
+    }
+
+    public int bottomUpGetMoneyAmount(int n) {
+        int[][] dp = new int[n + 1][n + 1];
+        for (int len = 2; len <= n; len++) {
+            for (int start = 1; start <= n - len + 1; start++) {
+                int end = start + len - 1;
+                dp[start][end] = Integer.MAX_VALUE;
+                for (int k = start; k < end; k++) {
+                    int cost = k + Math.max(dp[start][k - 1], dp[k + 1][end]);
+                    dp[start][end] = Math.min(dp[start][end], cost);
+                }
+            }
+        }
+        return dp[1][n];
+    }
+}

src/com/nphausg/leetcode/medium/GuessNumberHigherOrLowerIIKt.kt

@@ -0,0 +1,39 @@
+package com.nphausg.leetcode.medium
+
+/**
+ * @see <a href="https://leetcode.com/problems/guess-number-higher-or-lower-ii">375. Guess Number Higher or Lower II/a>
+ */
+class GuessNumberHigherOrLowerIIKt {
+
+    fun topDownGetMoneyAmount(n: Int): Int {
+        val memo = Array(n + 1) { IntArray(n + 1) }
+        return calculateCost(memo, 1, n)
+    }
+
+    private fun calculateCost(memo: Array<IntArray>, start: Int, end: Int): Int {
+        if (start >= end) return 0
+        if (memo[start][end] != 0) return memo[start][end]
+        var minCost = Int.MAX_VALUE
+        for (k in start..end) {
+            val cost = k + maxOf(calculateCost(memo, start, k - 1), calculateCost(memo, k + 1, end))
+            minCost = minOf(minCost, cost)
+        }
+        memo[start][end] = minCost
+        return minCost
+    }
+
+    fun bottomUpGetMoneyAmount(n: Int): Int {
+        val dp = Array(n + 1) { IntArray(n + 1) }
+        for (len in 2..n) {
+            for (start in 1..n - len + 1) {
+                val end = start + len - 1
+                dp[start][end] = Int.MAX_VALUE
+                for (k in start until end) {
+                    val cost = k + maxOf(dp[start][k - 1], dp[k + 1][end])
+                    dp[start][end] = minOf(dp[start][end], cost)
+                }
+            }
+        }
+        return dp[1][n]
+    }
+}