leetcode

0 class Solution {

1 public:

2 vector<vector<int>> construct2DArray(const vector<int> &original, int n, int m) const {

3 vector<vector<int>> res(n);

4

5 if (m * n != size(original)) return {};

6 for (int i = 0, k = 0; i < n; ++i) {

7 res[i] = vector(begin(original) + i * m, begin(original) + (i + 1) * m);

8 }

9

10 return res;

11 }

12 };