刷题打卡，现在刷了329题。

      q = [(i, j) for i, row in enumerate(rooms) for j, r in enumerate(row) if not r]
        for i, j in q:
            for I, J in (i+1, j), (i-1, j), (i, j+1), (i, j-1):
                if 0 <= I < len(rooms) and 0 <= J < len(rooms[0]) and rooms[I][J] > 2**30:
                    rooms[I][J] = rooms[i][j] + 1
                    q += (I, J),

286. Walls and Gates

286. Walls and Gates

287. Find the Duplicate Number

fast = nums[nums[fast]]
            slow = nums[slow]
            if slow == fast:
                break

287. Find the Duplicate Number        fast = nums[0]
        while fast != slow:
            fast = nums[fast]
            slow = nums[slow]

finished 363  now , but most do not familiar.

74. Search a 2D Matrix

921. Minimum Add to Make Parentheses Valid

410. Split Array Largest Sum

344. Reverse String