leetcode 2643. Row With Maximum Ones

https://leetcode.com/problems/row-with-maximum-ones/description/

Row With Maximum Ones - LeetCode

 

class Solution:
    def rowAndMaximumOnes(self, mat: List[List[int]]) -> List[int]:        
        start_sum, idx = sum(mat[0]), 0
        for i in range(1, len(mat)):
            if sum(mat[i]) > start_sum:
                idx = i
                start_sum = sum(mat[i])
        answer = [idx, start_sum]
        return answer