edit 375

Author: fishercoder1534

README.md

@@ -151,7 +151,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |385|[Mini Parser](https://leetcode.com/problems/mini-parser/)|[Solution](../master/src/main/java/com/fishercoder/solutions/MiniParser.java)| O(n)|O(h) | Medium| Stack
 |379|[Design Phone Directory](https://leetcode.com/problems/design-phone-directory/)|[Solution](../master/src/main/java/com/fishercoder/solutions/DesignPhoneDirectory.java)| O(1)|O(n) | Medium| 
 |377|[Combination Sum IV](https://leetcode.com/problems/combination-sum-iv/)|[Solution](../master/src/main/java/com/fishercoder/solutions/CombinationSumIV.java)| O(?)|O(?) | Medium|
-|375|[Guess Number Higher or Lower II](https://leetcode.com/problems/guess-number-higher-or-lower-ii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/GuessNumberHigherorLowerII.java)| O(n^2)|O(n^2) | Medium| DP
+|375|[Guess Number Higher or Lower II](https://leetcode.com/problems/guess-number-higher-or-lower-ii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_375.java)| O(n^2)|O(n^2) | Medium| DP
 |374|[Guess Number Higher or Lower](https://leetcode.com/problems/guess-number-higher-or-lower/)|[Solution](../master/src/main/java/com/fishercoder/solutions/GuessNumberHigherorLower.java)| O(logn)|O(1) | Easy| Binary Search
 |373|[Find K Pairs with Smallest Sums](https://leetcode.com/problems/find-k-pairs-with-smallest-sums/)|[Solution](../master/src/main/java/com/fishercoder/solutions/FindKPairsWithSmallestSums.java)| O(?)|O(?) | Medium| Heap
 |372|[Super Pow](https://leetcode.com/problems/super-pow/)|[Solution](../master/src/main/java/com/fishercoder/solutions/SuperPow.java)| O(n)|O(1) | Medium| Math

…olutions/GuessNumberHigherOrLowerII.java …java/com/fishercoder/solutions/_375.javasrc/main/java/com/fishercoder/solutions/GuessNumberHigherOrLowerII.java renamed to src/main/java/com/fishercoder/solutions/_375.java src/main/java/com/fishercoder/solutions/GuessNumberHigherOrLowerII.java renamed to src/main/java/com/fishercoder/solutions/_375.java

@@ -30,7 +30,7 @@ Take a small example (n = 3). What do you end up paying in the worst case?
  The purely recursive implementation of minimax would be worthless for even a small n. You MUST use dynamic programming.
  As a follow-up, how would you modify your code to solve the problem of minimizing the expected loss, instead of the worst-case loss?
  */
-public class GuessNumberHigherOrLowerII {
+public class _375 {
     public int getMoneyAmount(int n) {
         int[][] table = new int[n+1][n+1];
         return dp(table, 1, n);