题解 | 旋转数组

import java.util.*;


public class Solution {
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 旋转数组
     * @param n int整型 数组长度
     * @param m int整型 右移距离
     * @param a int整型一维数组 给定数组
     * @return int整型一维数组
     */
    public int[] solve (int n, int m, int[] a) {
        m = m % n;
        if (m == 0) {
            return a;
        }
        //翻转第一部分
        int k = Math.min(n - m, m);
        for (int i = 0; i < k; i++) {
            int temp = a[i];
            int index = n - 1 - i;
            a[i] = a[index];
            a[index] = temp;
        }
        for (int i = k; i < n / 2; i++) {
            int temp = a[i];
            int index = n - 1 - i;
            a[i] = a[index];
            a[index] = temp;
        }

        for (int i = 0; i < m / 2; i++) {
            int temp = a[i];
            a[i] = a[m - 1 - i];
            a[m - 1 - i] = temp;
        }

        for (int i = m; i < m + (n - m) / 2; i++) {
            int temp = a[i];
            a[i] = a[n - 1 - i + m];
            a[n - 1 - i + m] = temp;
        }
        return a;
    }
}