【LeetCode】189.Rotate Array(Easy)解题报告
题目地址:https://leetcode.com/problems/rotate-array/description/
题目描述:
Rotate an array of n elements to the right by k steps.
For example, with n = 7 and k = 3, the array [1,2,3,4,5,6,7] is rotated to [5,6,7,1,2,3,4].
Note:
Try to come up as many solutions as you can, there are at least 3 different ways to solve this problem.Related problem: Reverse Words in a String II
Solution1:
//time : O(n)
//space : O(n)
class Solution {
public void rotate(int[] nums, int k) {
int[] temp = new int[nums.length];
for(int i=0 ; i<nums.length ;i++){
temp[(i+k)%nums.length] = nums[i];
}
for(int i=0 ; i<nums.length ; i++){
nums[i] = temp[i];
}
}
}
Solution2:
//time : O(n)
//space : O(1)
/*
三次反转
1 2 3 4 5 6 7
7 6 5 4 3 2 1
5 6 7 4 3 2 1
5 6 7 1 2 3 4 -》result
*/
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);
}
public void reverse(int[] nums,int start,int end){
while(start<end){
int temp = nums[start];
nums[start] = nums[end];
nums[end] = temp;
start++;
end--;
}
}
}
Date:2018年2月20日