问题:
难度:easy
说明:
给出一个数组,然后有一个rotate,头尾旋转的长度,就原数组进行旋转。
问题链接:https://leetcode.com/problems/rotate-array/
相关问题:
Reverse Words in a String(将字符串单词顺序反转):https://blog.csdn.net/qq_28033719/article/details/107386312
输入案例:
Example 1:
Input: nums = [1,2,3,4,5,6,7], k = 3
Output: [5,6,7,1,2,3,4]
Explanation:
rotate 1 steps to the right: [7,1,2,3,4,5,6]
rotate 2 steps to the right: [6,7,1,2,3,4,5]
rotate 3 steps to the right: [5,6,7,1,2,3,4]
我的代码:
一样是可以二分处理,已经写过相关的算法处理了。
class Solution {
public void rotate(int[] nums, int k) {
k = k % nums.length;
divide(nums, 0, nums.length - 1);
divide(nums, 0, k - 1);
divide(nums, k, nums.length - 1);
}
public void divide(int[] nums, int begin, int end) {
int len = end + begin;
int mid = begin + end >> 1;
for(int i = begin;i <= mid;i ++) {
int temp = nums[i];
nums[i] = nums[len - i];
nums[len - i] = temp;
}
}
}
也可以重新拷贝一个数组来暂存数据处理
class Solution {
public void rotate(int[] nums, int k) {
int len = nums.length;
k = k % len;
if(k % len == 0) return;
int[] nums2 = nums.clone();
for(int i = 0;i < len;i ++) {
nums[k] = nums2[i];
k = ++ k % len;
}
}
}