【Hot100】LeetCode—189. 轮转数组

---

• 原题链接：189. 轮转数组

---

1- 思路

自定义 reverse 翻转函数

---

2- 实现

⭐189. 轮转数组——题解思路

class Solution {public void rotate(int[] nums, int k) {k %= nums.length;reverse(nums,0,nums.length-1);reverse(nums,0,k-1);reverse(nums,k,nums.length-1);}private void reverse(int[] nums,int i,int j){while(i<j){int tmp = nums[i];nums[i] = nums[j];nums[j] = tmp;i++;j--;}}
}

---

3- ACM 实现

public class rotate {private static void rotate(int[] nums,int k){k %= nums.length;reverse(nums,0,nums.length-1);reverse(nums,0,k-1);reverse(nums,k,nums.length-1);}private static void reverse(int[] nums,int i ,int j){while(i<j){int tmp = nums[i];nums[i] = nums[j];nums[j] = tmp;i++;j--;}}public static void main(String[] args) {Scanner sc = new Scanner(System.in);System.out.println("输入数组长度");int n = sc.nextInt();int[] nums = new int[n];for(int i = 0 ; i < nums.length ;i++){nums[i] = sc.nextInt();}System.out.println("输入k");int k = sc.nextInt();rotate(nums,k);for(int num:nums){System.out.print(num+" ");}}
}