leetcode-162周赛-1253-重构二进制矩阵

题目描述：

 

 

 

 自己的提交：

class Solution:
    def reconstructMatrix(self, upper: int, lower: int, colsum: List[int]) -> List[List[int]]:
        res = [[],[]]
        for v,i in enumerate(colsum):
            if i > 2: return []
            elif i == 2:
                res[0].append(1)
                res[1].append(1)
                upper,lower = upper-1,lower-1
            elif i == 1:
                if upper > lower:
                    res[0].append(1)
                    res[1].append(0)
                    upper -= 1
                else:
                    res[1].append(1)
                    res[0].append(0)
                    lower -= 1
            else:
                res[0].append(0)
                res[1].append(0)
            if upper < 0 or lower < 0:
                return []
            if v == len(colsum)-1 and upper|lower:
                return []
        return res