Maximum Matrix Sum LeetCode solution in Python

1
class Solution:
2
    def maxMatrixSum(self, matrix: List[List[int]]) -> int:
3
        # count -'s
4
        count = 0
5
        for row in matrix:
6
            for col_num in row:
7
                if col_num < 0:
8
                    count += 1
9
        tot_sum = sum([sum([abs(x) for x in row]) for row in matrix])
10
        if count % 2 == 0:
11
            return tot_sum
12
        else:
13
            min_val = min([min([abs(x) for x in row]) for row in matrix])
14
            return tot_sum - 2 * min_val