[Python3] Easy Greedy Solution
\nclass Solution:\n    def reconstructMatrix(self, upper: int, lower: int, colsum: List[int]) -> List[List[int]]:\n        n = len(colsum)\n        upper_list =
```\nclass Solution:\n    def reconstructMatrix(self, upper: int, lower: int, colsum: List[int]) -> List[List[int]]:\n        n = len(colsum)\n        upper_list = [0 for _ in range(n)]\n        lower_list = [0 for _ in range(n)]\n        \n        for i, v in enumerate(colsum):\n            if v == 1:\n                if upper > lower:\n                    upper_list[i] = 1\n                    upper -= 1\n                else:    \n                    lower_list[i] = 1\n                    lower -= 1\n            elif v == 2:        \n                upper_list[i] = lower_list[i] = 1\n                upper, lower = upper - 1, lower - 1\n                \n        return [upper_list, lower_list] if upper == lower == 0 else []\n```
[]