LeetCode - Rotate Array

标签：

Rotate Array

2015.4.17 05:37

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.

Solution:

　　Old problem, just solve it.

Accepted code:

 1 // FAQ
 2 #include <algorithm>
 3 using namespace std;
 4 
 5 class Solution {
 6 public:
 7     void rotate(int nums[], int n, int k) {
 8         if (k < 0) {
 9             k = n - (n - k) % n;
10         }
11         k %= n;
12         reverse(nums, nums + n - k);
13         reverse(nums + n - k, nums + n);
14         reverse(nums, nums + n);
15     }
16 };

LeetCode - Rotate Array

标签：

原文地址：http://www.cnblogs.com/zhuli19901106/p/4433853.html