[LeetCode]566. Reshape the Matrix

Solution如下

class Solution {
public:
    vector<vector<int>> matrixReshape(vector<vector<int>> &nums, int r, int c)
    {
        if (nums.size() == 0 && r * c != 0) {
            return nums;
        }
        if (nums.size() * nums[0].size() != r * c) {
            return nums;
        }
        vector<vector<int>> ret(r, vector<int>());
        cout << ret.size() << " " << ret[0].size() << endl;
        int index = 0;
        for (auto sub : nums) {
            for (auto i : sub) {                
                ret[index / c].push_back(i);
                index++;
                if (index == r * c)
                    return ret;
            }
        }
        return ret;
    }
};