[leetcode]Rotate Array
来源:互联网 发布:怎么做网络推广赚钱 编辑:程序博客网 时间:2024/04/30 21:13
Rotate Array
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.
解题思路:整体翻转后,部分再翻转
public class Solution { private void swapArrayInPiece(int[] a, int s, int e){ while(s < e){ a[s] ^= a[e]; a[e] ^= a[s]; a[s] ^= a[e]; s++; e--; } } public void rotate(int[] nums, int k) { int i = 0; int j = nums.length - 1; k = k % nums.length; if(k == 0) return; swapArrayInPiece(nums, i, j); swapArrayInPiece(nums, i, k - 1); swapArrayInPiece(nums, k, j); }}
0 0
- [leetcode][array] Rotate Array
- LeetCode[Array]: Rotate Image
- LeetCode:Rotate Array
- [LeetCode] Rotate Array
- *LeetCode-Rotate Array
- [LeetCode]189.Rotate Array
- Rotate Array - LeetCode - Java
- Rotate Array--Leetcode(Java)
- Leetcode--Rotate Array
- LeetCode: Rotate Array
- LeetCode Rotate Array
- Rotate Array(leetcode)
- leetcode Rotate Array
- Leetcode: Rotate Array
- [Leetcode]11 Rotate Array
- [LeetCode][189][Rotate Array]
- Leetcode:Rotate Array
- LeetCode: Rotate Array
- sdfsd
- g++出现No such file or directory问题
- 冒泡排序的C++实现
- Eddy's digital Roots
- RFC3581——SIP中的rport机制
- [leetcode]Rotate Array
- 【数据结构与算法分析(一)】排序
- #290 (div.2) C. Fox And Names
- hdu 5203 Rikka with wood sticks
- 今天继续学习锋利的JQuery,第三章后半段
- Shell编程入门总结(正则表达式篇)
- ctags for systemverilog(vim用)
- Linux 2.6 Completely Fair Scheduler 内幕
- 【Java二十周年】我的JAVA小时代