2022_Convert1DArrayInto2DArray - a920604a/leetcode GitHub Wiki
class Solution {
public:
vector<vector<int>> construct2DArray(vector<int>& original, int m, int n) {
vector<vector<int>> ret;
if(original.size() != m*n) return ret;
ret = vector<vector<int>>(m,vector<int>(n,0));
int k =0 , c = original.size();
for(int i=0;i<m;i++){
for(int j = 0;j<n;++j){
ret[i][j] = original[k++];
}
}
return ret;
}
};
- time complexity
O(n)
- space complexity
O(1)