Rotate Array Problem


Description

LeetCode Problem 189.

Given an array, rotate the array to the right by k steps, where k is non-negative.

Example 1:

1
2
3
4
5
6
Input: nums = [1,2,3,4,5,6,7], 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:

1
2
3
4
5
Input: nums = [-1,-100,3,99], 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]

Constraints:

  • 1 <= nums.length <= 10^5
  • -2^31 <= nums[i] <= 2^31 - 1
  • 0 <= k <= 10^5


Sample C++ Code

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
class Solution {
public:
    void rotate(vector<int>& nums, int k) {
        int n = nums.size();
        if (n == 0)
            return;
        k = k % n;
        int tmp;
        
        
        for (int i = 0; i < n-k; i ++) {
            nums.push_back(nums[i]);
        }
        nums.erase(nums.begin(), nums.begin()+n-k);
        
    }
};




Related Posts

Rotate Array Problem

LeetCode 189. Given an array, rotate the array to the...

Plus One Problem

LeetCode 66. You are given a large integer represented as...

Spiral Matrix Problem

LeetCode 54. Given an m x n matrix, return all...

Spiral Matrix II Problem

LeetCode 59. Given a positive integer n, generate an n...

Jump Game Problem

LeetCode 55. Given an m x n matrix, return all...

Insert Interval Problem

LeetCode 57. Insert newInterval into intervals such that intervals is...