Basic and Easiest approach for this problem in java for beginners✅💯💥💥
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 count = 0;\n         long sum = 0;\n        int min = Integer.MAX_VALUE;\n        for (int i = 0; i < matrix.length; i++) {\n            for (int j = 0; j < matrix[i].length; j++) {\n                sum = sum + Math.abs(matrix[i][j]);\n                 if (matrix[i][j] < 0) {\n                    count ++;\n                 }\n                 if (min > Math.abs(matrix[i][j])) {\n                    min = Math.abs(matrix[i][j]);\n                 }\n            }\n        }\n        if (count % 2 == 0) {\n            return sum;\n        }\n        return sum - (2*min);\n    }\n}\n```
['Java']