题解 | #旋转数组#

public class Solution {

    public int[] solve (int n, int m, int[] a) {
        m = m%n;
        // write code here
        reverse(a, 0, n-1);
        reverse(a, 0, m-1);
        reverse(a, m, n-1);
        return a;
    }

    public void reverse(int[] a, int s, int e){
        int temp;
        while(s<e){
            temp = a[s];
            a[s] = a[e];
            a[e] = temp;
            s++;
            e--;
        }
    }
}