class Solution:
def maxMatrixSum(self, matrix: List[List[int]]) -> int:
less_zero = 0
min_num = float('inf')
sum_num = 0
for i in range(len(matrix)):
for j in range(len(matrix[0])):
if matrix[i][j] < 0:
less_zero = less_zero + 1
sum_num = sum_num + abs(matrix[i][j])
min_num = min(min_num, abs(matrix[i][j]))
if less_zero % 2 == 1:
return sum_num - 2 * min_num
else:
return sum_num