LeetCode *** 189. Rotate Array
来源:互联网 发布:350淘宝装修平台 编辑:程序博客网 时间:2024/04/30 03:47
题目:
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]
.
代码:
class Solution {public: void rotate(vector<int>& nums, int k) { int len=nums.size(); for(int i=0;i<k;++i){ int tmp=nums[len-1]; nums.erase(nums.end()-1); nums.insert(nums.begin(),tmp); } }};
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
- 标准模板库(STL)之 queue 列传
- Http请求头探讨
- If(!a) ; try catch用法
- GCJ 2016 资格赛 C题
- hibernate内部实现的探讨
- LeetCode *** 189. Rotate Array
- BP神经网络原理及编程实现
- 初识C++之继承
- 重视!!!Tomcat 严重: Catalina.stop 问题解决
- 0036vs2008下ogre1.6.5常见的一个配置小遗漏
- NOIP普及组2013 计数问题
- 验证码功能实现
- Positive Con Sequences
- 微信公众号的开发之旅(1)