Update Solution.java

Author: javadev

src/main/java/g1901_2000/s1937_maximum_number_of_points_with_cost/Solution.java

@@ -5,26 +5,21 @@
 public class Solution {
  public long maxPoints(int[][] points) {
  int m = points[0].length;
-
  long[] pre = new long[m];
-
  for (int[] point : points) {
  long[] current = new long[m];
-
  long max = Long.MIN_VALUE;
  for (int j = 0; j < m; j++) {
  max = Math.max(max, pre[j] + j);
  current[j] = Math.max(current[j], point[j] - j + max);
  }
-
  max = Long.MIN_VALUE;
  for (int j = m - 1; j >= 0; j--) {
  max = Math.max(max, pre[j] - j);
  current[j] = Math.max(current[j], point[j] + j + max);
  }
  pre = current;
  }
-
  long max = Long.MIN_VALUE;
  for (long val : pre) {
  max = Math.max(max, val);