Niuke: rotation array

  This problem is done with array flipping , Didn't you think ...

It's amazing , From the example of the topic ：

123456 Flip whole into 654321

Then we flip the front 2 Bit becomes 564321, After flipping 4 And the bits become 561234, Isn't that amazing ....

At first I thought of using circular shift to do ...

The answer is as follows ：

class Solution {
public:
    /**
     *  Rotated array 
     * @param n int integer   The length of the array 
     * @param m int integer   Shift right distance 
     * @param a int integer vector  Given array 
     * @return int integer vector
     */
    vector<int> solve(int n, int m, vector<int>& a) {
        m = m%n;
        reverse(a.begin(), a.end());
        reverse(a.begin(), a.begin()+m);
        reverse(a.begin()+m, a.end());
        return a;
    }
};