LeetCode
来源:互联网 发布:福州广电网络客服 编辑:程序博客网 时间:2024/06/02 04:27
Q:
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]
.
A:
class Solution(object): def rotate(self, nums, k): """ :type nums: List[int] :type k: int :rtype: void Do not return anything, modify nums in-place instead. """ k = k % len(nums) nums[:] = nums[-k:] + nums[:-k]
参考 My solution by using Python by Maples7 & GavinCode
阅读全文
0 0
- leetcode
- [leetcode]
- LeetCode
- leetcode
- leetcode
- leetcode:
- leetcode:
- LeetCode
- leetcode
- LEETCODE
- leetcode
- leetCode
- leetcode
- [leetcode]
- LeetCode
- leetcode
- leetcode:
- leetcode
- Linux常用命令大全(新手入门)
- 【oracle】用户权限及角色管理
- 第8章 Vue.js工程实例
- 内存多通道对fluent运算速度的影响
- bootstrap table 导出所有全部数据
- LeetCode
- password_hash
- SPOJ SUBST1
- MajorityElement
- ArcEngine实现Merge功能
- 第二周项目三(2)
- UVA 11183 Teen Girl Squad(最小树形图)
- iBATIS SQL Maps之缓存Mapped Statement结果集。
- hihocoder 1432 JiLi Number