|
| 1 | +package com.fishercoder.solutions; |
| 2 | + |
| 3 | +public class _1690 { |
| 4 | + public static class Solution1 { |
| 5 | + |
| 6 | + int[] stonesRef; |
| 7 | + |
| 8 | + int[] prepareSums; |
| 9 | + |
| 10 | + int[][] maxDiffScoureBetweenTowPlayerWhenPlayInPosItoJ = new int[1005][1005]; |
| 11 | + |
| 12 | + public int stoneGameVII(int[] stones) { |
| 13 | + this.stonesRef = stones; |
| 14 | + int totalStonesNumber = stones.length; |
| 15 | + this.prepareSums = new int[totalStonesNumber + 1]; |
| 16 | + for (int i = 1; i <= totalStonesNumber; i++) { |
| 17 | + this.prepareSums[i] = this.prepareSums[i - 1] + stones[i - 1]; |
| 18 | + } |
| 19 | + for (int len = 1; len <= totalStonesNumber; len++) { |
| 20 | + for (int i = 1; i + len - 1 <= totalStonesNumber; i++) { |
| 21 | + int j = i + len - 1; |
| 22 | + this.setMaxDiffScoureBetweenTowPlayerWhenPlayInPosItoJ(i, j); |
| 23 | + } |
| 24 | + } |
| 25 | + return maxDiffScoureBetweenTowPlayerWhenPlayInPosItoJ[1][totalStonesNumber]; |
| 26 | + } |
| 27 | + |
| 28 | + private void setMaxDiffScoureBetweenTowPlayerWhenPlayInPosItoJ(int i, int j) { |
| 29 | + if (j - i == 0) { |
| 30 | + maxDiffScoureBetweenTowPlayerWhenPlayInPosItoJ[i][j] = 0; |
| 31 | + } else if (j - i == 1) { |
| 32 | + maxDiffScoureBetweenTowPlayerWhenPlayInPosItoJ[i][j] = Math.max(stonesRef[i - 1], stonesRef[j - 1]); |
| 33 | + } else { |
| 34 | + maxDiffScoureBetweenTowPlayerWhenPlayInPosItoJ[i][j] = Math.max( |
| 35 | + this.sumOfTheStonesValueInPosIToJ(i + 1, j) |
| 36 | + - maxDiffScoureBetweenTowPlayerWhenPlayInPosItoJ[i + 1][j], |
| 37 | + this.sumOfTheStonesValueInPosIToJ(i, j - 1) |
| 38 | + - maxDiffScoureBetweenTowPlayerWhenPlayInPosItoJ[i][j - 1]); |
| 39 | + } |
| 40 | + } |
| 41 | + |
| 42 | + private int sumOfTheStonesValueInPosIToJ(int i, int j) { |
| 43 | + return this.prepareSums[j] - this.prepareSums[i - 1]; |
| 44 | + } |
| 45 | + } |
| 46 | +} |
0 commit comments