leetCode :旋转数组--Rotate Array

• 题目描述
• Given an array, rotate the array to the right by k steps, where k is non-negative.
• 就是将数组进行右旋转
  Example 1:
  Input: [1,2,3,4,5,6,7] and 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]
  Example 2:
  Input: [-1,-100,3,99] and k = 2
  Output: [3,99,-1,-100]
  Explanation:
  rotate 1 steps to the right: [99,-1,-100,3]
  rotate 2 steps to the right: [3,99,-1,-100]
  思路： 右旋转k次，说明从第n-k个开始到最后一个将其移动到原数组的前面就可了。简单题目，注意安全校验就可以。
  参考代码：

class Solution {
    public void rotate(int[] nums, int k) {
        while(k >= nums.length) {
  		k = k - nums.length;
  	}
    int[] temp = new int[nums.length];
  	
  	int head = nums[0]; 
  	int a = nums.length-k;
  	int i = 0;
    if(nums == null ||nums.length == 1) {
  		return;
  	}
  	while(a < temp.length) {
  		temp[i++] = nums[a++];
  	}
  	int h = 0;
  	while(h < nums.length-k) {
  		temp[i++] = nums[h++];
  	}
  	for(int j = 0; j< nums.length;j++) {
  		nums[j] = temp[j];
  	}
 }
}