前往小程序,Get更优阅读体验!
立即前往
首页
学习
活动
专区
工具
TVP
发布
社区首页 >专栏 >LeetCode 0189 - Rotate Array

LeetCode 0189 - Rotate Array

作者头像
Reck Zhang
发布2021-08-11 14:54:50
2140
发布2021-08-11 14:54:50
举报
文章被收录于专栏:Reck Zhang

Rotate Array

Desicription

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

Example 1:

代码语言:javascript
复制
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:

代码语言:javascript
复制
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]

Note:

  • Try to come up as many solutions as you can, there are at least 3 different ways to solve this problem.
  • Could you do it in-place with O(1) extra space?

Solution

代码语言:javascript
复制
class Solution {
private:
    void fun(vector<int>& nums, int left, int right) {
        if(left >= right)
            return ;
        while(left <= right) {
            swap(nums[left], nums[right]);
            left++;
            right--;
        }
    }
public:
    void rotate(vector<int>& nums, int k) {
        k = k % nums.size();
        fun(nums, 0, nums.size() - 1);
        fun(nums, 0, k - 1);
        fun(nums, k, nums.size() - 1);
    }
};
本文参与 腾讯云自媒体同步曝光计划,分享自作者个人站点/博客。
原始发表:2018-06-11,如有侵权请联系 cloudcommunity@tencent.com 删除

本文分享自 作者个人站点/博客 前往查看

如有侵权,请联系 cloudcommunity@tencent.com 删除。

本文参与 腾讯云自媒体同步曝光计划  ,欢迎热爱写作的你一起参与!

评论
登录后参与评论
0 条评论
热度
最新
推荐阅读
目录
  • Rotate Array
    • Desicription
      • Solution
      领券
      问题归档专栏文章快讯文章归档关键词归档开发者手册归档开发者手册 Section 归档