【LeetCode】 189. Rotate Array
来源:互联网 发布:cpu散片淘宝店家推荐? 编辑:程序博客网 时间:2024/06/07 20:36
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]
.
public class Solution { public void rotate(int[] nums, int k) { if (nums.length <= 1) { return; } int step = k % nums.length; int[] temp = nums.clone(); System.arraycopy(temp, 0, nums, step, nums.length - step); System.arraycopy(temp, nums.length - step, nums, 0, step); }}
0 0
- [LeetCode]189.Rotate Array
- [Leetcode] 189.Rotate Array
- LeetCode 189. Rotate Array
- 【LeetCode】189.Rotate Array
- [leetcode] 189.Rotate Array
- 【leetcode】189. Rotate Array
- Leetcode 189. Rotate Array
- 189. Rotate Array LeetCode
- [LeetCode]189. Rotate Array
- leetcode-189.-Rotate Array
- LeetCode 189. Rotate Array
- leetcode 189. Rotate Array
- LeetCode *** 189. Rotate Array
- [LeetCode]189. Rotate Array
- LeetCode 189. Rotate Array
- leetcode-189. Rotate Array
- Leetcode 189. Rotate Array
- leetcode 189. Rotate Array
- 【LeetCode】 172. Factorial Trailing Zeroes
- bzoj 3238: [Ahoi2013]差异 (后缀自动机+树形dp)
- 基于TCP的半关闭
- Leetcode 153. Find Minimum in Rotated Sorted Array
- 第七十五天学习笔记
- 【LeetCode】 189. Rotate Array
- deeplab-v2 安装问题总结
- 【作业存档】堆排序和插入排序的练习
- android动画-布局动画(3)
- android AsyncTask介绍
- <caffe安装系列>deeplab-v2问题总结
- C++ call fortran using cmd
- 文章标题 关于java运算符的知识点以及如何从键盘输入
- 【LeetCode】 190. Reverse Bits