f
方案一:
class Solution {
public:
vector<vector<int>> construct2DArray(vector<int>& original, int m, int n) {
vector<vector<int>> ans;
if (original.size() != m * n) {
return ans;
}
for (auto it = original.begin(); it != original.end(); it += n) {
ans.emplace_back(it, it + n);
}
return ans;
}
};
Python代码
import numpy as np
class Solution:
def construct2DArray(self, original: List[int], m: int, n: int) -> List[List[int]]:
return np.array(original).reshape(m, n).tolist() if m * n == len(original) else []