1、題目

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.

[show hint]

Related problem:?Reverse Words in a String II

Credits:
Special thanks to?@Freezen?for adding this problem and creating all test cases.

2、結題思路

1、先得到有效的k, 2、反轉所有數組 3、反轉下標從0到k的數組 4、 反轉下標從k到length - 1的數組

?

3、代碼實現

class Solution {public void rotate(int[] nums, int k) {if (nums == null || nums.length == 0 || k <= 0)return;int length = nums.length;int lastK = 0;if (k < length)lastK = k;else lastK = k % length;if (lastK == 0)return;change(nums, length);change(nums, lastK);int i = lastK, j = length - 1;while (i < j) {int temp = nums[i];nums[i] = nums[j];nums[j] = temp;i++;j--;}}public void change(int[] nums, int length) {for (int i = 0; i < length / 2; ++i) {int temp = nums[i];nums[i] = nums[length - i - 1];nums[length - i - 1] = temp;}} }
?

?

總結

以上是生活随笔為你收集整理的LeetCode之Rotate Array的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。