Maximum Matrix Sum LeetCode solution in Java

1
class Solution {
2
  public long maxMatrixSum(int[][] matrix) {
3
    long ans = 0;
4
    int neg = 0;
5
    int min = Integer.MAX_VALUE;
6
    for (int i = 0; i < matrix.length; i++) {
7
      for (int j = 0; j < matrix[0].length; j++) {
8
        if (matrix[i][j] < 0) {
9
          neg++;
10
        }
11
        ans += Math.abs(matrix[i][j]);
12
        if (min > Math.abs(matrix[i][j])) min = Math.abs(matrix[i][j]);
13
      }
14
    }
15
    if (neg % 2 == 0) return ans;
16
    else return ans - 2 * min;
17
  }
18
}