1253. Reconstruct a 2-Row Binary Matrix

1253. Reconstruct a 2-Row Binary Matrix
      Medium

86

9

Add to List

Share
Given the following details of a matrix with n columns and 2 rows :

The matrix is a binary matrix, which means each element in the matrix can be 0 or 1.
The sum of elements of the 0-th(upper) row is given as upper.
The sum of elements of the 1-st(lower) row is given as lower.
The sum of elements in the i-th column(0-indexed) is colsum[i], where colsum is given as an integer array with length n.
Your task is to reconstruct the matrix with upper, lower and colsum.

Return it as a 2-D integer array.

If there are more than one valid solution, any of them will be accepted.

If no valid solution exists, return an empty 2-D array.

Example 1:

Input: upper = 2, lower = 1, colsum = [1,1,1]
Output: [[1,1,0],[0,0,1]]
Explanation: [[1,0,1],[0,1,0]], and [[0,1,1],[1,0,0]] are also correct answers.
Example 2:

Input: upper = 2, lower = 3, colsum = [2,2,1,1]
Output: []
Example 3:

Input: upper = 5, lower = 5, colsum = [2,1,2,0,1,0,1,2,0,1]
Output: [[1,1,1,0,1,0,0,1,0,0],[1,0,1,0,0,0,1,1,0,1]]

Constraints:

1 <= colsum.length <= 10^5
0 <= upper, lower <= colsum.length
0 <= colsum[i] <= 2

class Solution {
public:
    vector<vector<int>> reconstructMatrix(int upper, int lower, vector<int>& colsum) {
        //上层1的个数=upper，下层1的个数=lower，colsum表示各列的和
        int n=colsum.size();
        vector<vector<int>>res(2,vector<int>(n));//两行
        int u=0,l=0;//u表示上层1的个数，l表示下层1的个数
        for(int i=0;i<n;i++)
        {
            if(colsum[i]==1) continue;
            if(colsum[i]==2&&l<lower&&u<upper) res[0][i]=1,res[1][i]=1,l++,u++;
            else if(colsum[i]==0) res[0][i]=0,res[1][i]=0;
            else
            {
            	res.clear();
            	return res;
            }
        }
            
        for(int i=0;i<n;i++)
        {
            if(colsum[i]==0||colsum[i]==2) continue;
            
            if(l<lower) res[0][i]=0,res[1][i]=1,l++;
            else if(u<upper)res[0][i]=1,res[1][i]=0,u++;
            else
            {
                res.clear();
                return res;
            }
        }
        if(l!=lower||u!=upper) res.clear();
        return res;
    }
};