DSA-java/lc486.java at main · yashwan7/DSA-java · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
public class lc486 {

class Solution {

    Integer[][] dp;

    public boolean predictTheWinner(int[] nums) {

        int n = nums.length;
        dp = new Integer[n][n];

        return solve(nums, 0, n - 1) >= 0;
    }

    private int solve(int[] nums, int i, int j) {

        if (i == j) {
            return nums[i];
        }

        if (dp[i][j] != null) {
            return dp[i][j];
        }

        int takeLeft = nums[i] - solve(nums, i + 1, j);
        int takeRight = nums[j] - solve(nums, i, j - 1);

        return dp[i][j] = Math.max(takeLeft, takeRight);
    }
}

//class Solution {
  //  public boolean predictTheWinner(int[] nums) {
  //      return solve(nums, 0, nums.length - 1, 0, 0, 0);
  //  }
//
  //  boolean solve(int[] nums, int i, int j, int turn, int score1, int score2) {
//
  //      if (i > j) {
  //          return score1 >= score2;
  //      }
  //      if (turn == 0) { // Player 1's turn
///
  //          boolean takeLeft = solve(nums, i + 1, j, 1,
  //                                   score1 + nums[i], score2);
//
  //          boolean takeRight = solve(nums, i, j - 1, 1,
  //                                    score1 + nums[j], score2);
//
  //          return takeLeft || takeRight;
  //      } else { // Player 2's turn
//
  //          boolean takeLeft = solve(nums, i + 1, j, 0,
  //                                  score1, score2 + nums[i]);
//
  ///          boolean takeRight = solve(nums, i, j - 1, 0,
  //                                    score1, score2 + nums[j]);
//
  //          return takeLeft && takeRight;
  //      }
  //  } }

}