<p>Given a 2D <code>grid</code> of size <code>m x n</code>&nbsp;and an integer <code>k</code>. You need to shift the <code>grid</code>&nbsp;<code>k</code> times.</p>

<p>In one shift operation:</p>

<ul>
	<li>Element at <code>grid[i][j]</code> moves to <code>grid[i][j + 1]</code>.</li>
	<li>Element at <code>grid[i][n - 1]</code> moves to <code>grid[i + 1][0]</code>.</li>
	<li>Element at <code>grid[m&nbsp;- 1][n - 1]</code> moves to <code>grid[0][0]</code>.</li>
</ul>

<p>Return the <em>2D grid</em> after applying shift operation <code>k</code> times.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2019/11/05/e1.png" style="width: 400px; height: 178px;" />
<pre>
<strong>Input:</strong> <code>grid</code> = [[1,2,3],[4,5,6],[7,8,9]], k = 1
<strong>Output:</strong> [[9,1,2],[3,4,5],[6,7,8]]
</pre>

<p><strong class="example">Example 2:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2019/11/05/e2.png" style="width: 400px; height: 166px;" />
<pre>
<strong>Input:</strong> <code>grid</code> = [[3,8,1,9],[19,7,2,5],[4,6,11,10],[12,0,21,13]], k = 4
<strong>Output:</strong> [[12,0,21,13],[3,8,1,9],[19,7,2,5],[4,6,11,10]]
</pre>

<p><strong class="example">Example 3:</strong></p>

<pre>
<strong>Input:</strong> <code>grid</code> = [[1,2,3],[4,5,6],[7,8,9]], k = 9
<strong>Output:</strong> [[1,2,3],[4,5,6],[7,8,9]]
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>m ==&nbsp;grid.length</code></li>
	<li><code>n ==&nbsp;grid[i].length</code></li>
	<li><code>1 &lt;= m &lt;= 50</code></li>
	<li><code>1 &lt;= n &lt;= 50</code></li>
	<li><code>-1000 &lt;= grid[i][j] &lt;= 1000</code></li>
	<li><code>0 &lt;= k &lt;= 100</code></li>
</ul>

class Solution {
public:
    vector<vector<int>> shiftGrid(vector<vector<int>>& grid, int k) {
        vector<vector<int>> result(grid.size(), vector<int>(grid[0].size()));
        vector<int> ans;
        vector<int> temp;
        // if (grid[0].size() == 1 && grid.size() == 1) {
        //     return grid;
        // } else {

        //     for (int i = 0; i < grid.size(); i++) {
        //         for (int j = 0; j < grid[0].size(); j++) {
        //             ans.push_back(grid[i][j]);
        //         }
        //     }
        //     // cout<<ans.size();
        //     int size = ans.size();

        //     if (k <= ans.size()) {
        //         //  cout << "YES THIS IS ENBLE" ;
        //         for (int j = 0; j < k; j++) {
        //             temp.insert(temp.begin(), ans[size - 1]);
        //             size--;
        //         }
        //         for (int i = 0; i < ans.size() - k; i++) {
        //             temp.push_back(ans[i]);
        //         }
        //     } else {
        //         int count = 0;
        //         for (int j = 0; j < k; j++) {
        //             if (j < ans.size()) {
        //                 temp.insert(temp.begin(), ans[size - 1]);
        //                 size--;
        //             } else {
        //                 temp.insert(temp.begin(), temp[temp.size() - 1]);
        //                 temp.pop_back();
        //                 count++;
        //             }
        //             if (count == ans.size()) {
        //                 size = ans.size();
        //             }
        //         }
        //     }
        //     int count = 0;
        //     for (int i = 0; i < grid.size(); ++i) {
        //         for (int j = 0; j < grid[0].size(); ++j) {
        //             result[i][j] = temp[count];
        //             count++;
        //         }
        //     }
        // }
        // return result;

        //             2nd approach
        for (int i = 0; i < grid.size(); i++) {
            for (int j = 0; j < grid[0].size(); j++) {
                ans.push_back(grid[i][j]);
            }
        }

        int size = ans.size();
        k = k % size;
        if (k > 0) {
            temp.insert(temp.begin(), ans.end() - k, ans.end());
            temp.insert(temp.end(), ans.begin(), ans.end() - k);
        } else {
            temp = ans;
        }
        int count = 0;
        for (int i = 0; i < grid.size(); ++i) {
            for (int j = 0; j < grid[0].size(); ++j) {
                result[i][j] = temp[count];
                count++;
            }
        }
        return result;
    }
};
18200