Find Champion I — Python

# Time:  O(n^2)
# Space: O(1)

# array
class Solution(object):
    def findChampion(self, grid):
        """
        :type grid: List[List[int]]
        :rtype: int
        """
        return next(u for u in xrange(len(grid)) if sum(grid[u]) == len(grid)-1)