Talk to me once
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```java []\nclass Solution {\n    public long maxMatrixSum(int[][] matrix) {\n     int min = Integer.MAX_VALUE;\n    long sum = 0;\n    int negCount = 0; \n    for(int i=0; i<matrix.length; i++)\n    for(int j=0; j<matrix[0].length; j++)\n    {\n     if(matrix[i][j]<0)\n     negCount++;\n     int ab = Math.abs(matrix[i][j]);\n     min = Math.min(min, ab);\n     sum += ab;    \n    }\n    if(negCount%2==0)\n    return sum; \n    return sum - 2*min;   \n    }\n}\n```
['Java']