189,求旋转数组
解法一:递归旋转,将整个数组旋转,在将后k个元素和0到k-1个元素旋转
class Solution { public void rotate(int[] nums, int k) { int n=nums.length; k = k%n; reverse(nums,0,n-1); reverse(nums,0,k-1); reverse(nums,k,n-1); } public void reverse(int[] nums,int start,int end){ while (start<end){ int temp = nums[start]; nums[start++]=nums[end]; nums[end--] = temp; } } }
LeetCode刷题笔记(Java版)----189,求旋转数组
最新推荐文章于 2023-10-05 01:13:51 发布