Leetcode 189. Rotate Array (Java)

最新推荐文章于 2024-09-27 10:11:28 发布

内心的脊梁

最新推荐文章于 2024-09-27 10:11:28 发布

阅读量152

点赞数

本文链接：https://blog.csdn.net/weixin_58080442/article/details/123638806

版权

这篇博客讨论了一种在Java中实现数组按指定步数向右旋转的方法。通过双重循环，将数组元素依次移动到正确的位置，实现了对数组的旋转操作。示例展示了如何处理不同输入，包括正整数和负数元素的数组，以及不同的旋转步数k。

摘要由CSDN通过智能技术生成

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

Example 1:

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:

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 <= 105
-231 <= nums[i] <= 231 - 1
0 <= k <= 105

class Solution {
    public void rotate(int[] nums, int k) {
    
        int temp;
        int previous;
        for(int i=0;i<k;i++)
        {
            previous=nums[nums.length-1];
            for(int j=0;j<nums.length;j++)
            {
                temp=nums[j];
                nums[j]=previous;
                previous=temp;
            }
        }
    }
}