一、题目
二、代码
class Solution
{
public void rotate(int[] nums, int k)
{
int i;
int length = nums.length;
int temp = 0;
System.out.println(" length "+ length);
k = k%length;
for(i=0;i<length/2;i++)
{
temp = nums[i];
nums[i] = nums[length-1-i];
nums[length-1-i] = temp;
}
for(i=0;i<k/2&&(k-1-i)>=0&&(k-1-i)<length;i++)
{
System.out.println(" i " +i);
System.out.println(" k " +k);
temp = nums[i];
nums[i] = nums[k-1-i];
nums[k-1-i] = temp;
}
for(i=k;i<k+ (length-k)/2 &&(length-1+k-i)>=0&&(length-1+k-i)<length ;i++)
{
temp = nums[i];
nums[i] = nums[length-1+k-i];
nums[length-1+k-i] = temp;
}
}
}
三、运行结果