Java Solutions - easy approach
Idea\nIf their are even negatives then go return the absolute sum \nelse return the absolute sum- smallest absolute positve integer twice!\n\nIn JAVA\n\nclass S
**Idea**\nIf their are even negatives then go return **the absolute sum** \nelse return **the absolute sum- smallest absolute positve integer twice!**\n```\nIn JAVA\n\nclass Solution {\n    public long maxMatrixSum(int[][] matrix) {\n        \n    \tint i,j,n=matrix.length,neg_nums=0,m=matrix[0].length,min=Integer.MAX_VALUE;\n    \tlong ans=0;\n    \tfor(i=0;i<n;i++)\n    \t\tfor(j=0;j<m;j++) {\n    \t\t\tif(matrix[i][j]<0)\n    \t\t\t\tneg_nums++;\n    \t\t\tmin=Math.min(min, Math.abs(matrix[i][j]));\n    \t\t\tans+=Math.abs(matrix[i][j]);\n    \t\t}\n    \tif(neg_nums%2==0)\n    \t\treturn ans;\n    \treturn ans-min-min;\n    \t\n    }\n}\n```
['Java']