Python fast


  • 0
    B

    '''
    class Solution(object):
    def maxCount(self, m, n, ops):
    """
    :type m: int
    :type n: int
    :type ops: List[List[int]]
    :rtype: int
    """
    r=m;
    c=n;
    for ind in range(0,len(ops)):
    if ops[ind][0]<r:
    r=ops[ind][0]
    if ops[ind][1]<c:
    c=ops[ind][1]
    if r==0 and c==0:
    return 1

        return r*c'''

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.