leetcode

0 class Solution {

1 public:

2 long long maxMatrixSum(const vector<vector<int>> &matrix) const {

3 const int n = size(matrix);

4 int count = 0, mini = INT_MAX;

5 long long res = 0;

6

7 for (int i = 0; i < n; i++) {

8 for (int j = 0; j < n; j++) {

9 res += abs(matrix[i][j]);

10 count += matrix[i][j] < 0;

11 mini = min(mini, abs(matrix[i][j]));

12 }

13 }

14

15 return count % 2 == 0 ? res : res - 2 * mini;

16 }

17 };