You are given a positive integer k. You are also given:
rowConditions of size n where rowConditions[i] = [above_i, below_i], andcolConditions of size m where colConditions[i] = [left_i, right_i].The two arrays contain integers from 1 to k.
You have to build a k x k matrix that contains each of the numbers from 1 to k exactly once. The remaining cells should have the value 0.
The matrix should also satisfy the following conditions:
above_i should appear in a row that is strictly above the row at which the number below_i appears for all i from 0 to n - 1.left_i should appear in a column that is strictly left of the column at which the number right_i appears for all i from 0 to m - 1.Return any matrix that satisfies the conditions. If no answer exists, return an empty matrix.
2 <= k <= 4001 <= rowConditions.length, colConditions.length <= 10^4rowConditions[i].length == colConditions[i].length == 21 <= above_i, below_i, left_i, right_i <= kabove_i != below_ileft_i != right_ik = 3, rowConditions = [[1,2],[3,2]], colConditions = [[2,1],[3,2]][[3,0,0],[0,0,1],[0,2,0]]k = 3, rowConditions = [[1,2],[2,3],[3,1],[2,3]], colConditions = [[2,1]][]