MCPcopy Create free account
hub / github.com/algorithm004-03/algorithm004-03 / rotate2

Method rotate2

Week 01/id_668/leetcode_189_668.py:62–77  ·  view source on GitHub ↗

:type nums: List[int] :type k: int :rtype: None Do not return anything, modify nums in-place instead. 时间复杂度:O(k * n) 空间复杂度:O(1)

(self, nums, k)

Source from the content-addressed store, hash-verified

source not stored for this graph (policy: none)

Callers

nothing calls this directly

Calls 2

popMethod · 0.45
insertMethod · 0.45

Tested by

no test coverage detected