-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathindex.ts
55 lines (54 loc) · 1.33 KB
/
index.ts
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
/**
* # 189 Retate Array
*
* Given an array, rotate the array to the right by k steps, where k is non-negative.
*
* ## Example
*
* ```bash
* Input: [1,2,3,4,5,6,7] and k = 3
* Output: [5,6,7,1,2,3,4]
* Explanation:
* rotate 1 steps to the right: [7,1,2,3,4,5,6]
* rotate 2 steps to the right: [6,7,1,2,3,4,5]
* rotate 3 steps to the right: [5,6,7,1,2,3,4]
* ```
*
* ```bash
* Input: [-1,-100,3,99] and k = 2
* Output: [3,99,-1,-100]
* Explanation:
* rotate 1 steps to the right: [99,-1,-100,3]
* rotate 2 steps to the right: [3,99,-1,-100]
* ```
*
* ## Note
*
* - Try to come up as many solutions as you can, there are at least 3 different ways to solve this problem.
* - Could you do it in-place with O(1) extra space?
*/
export type Solution = (nums: number[], k: number) => void;
/**
* in-place
* @date 2020.06.29 08:35
* @time
* @space
* @runtime 236 ms, faster than 100.00%
* @memory 37.3 MB, less than 100.00%
* @runtime_cn 328 ms, faster than 7.14%
* @memory_cn 36.6 MB, less than 100%
*/
export const rotate = (nums: number[], k: number): void => {
const len = nums.length;
k = k % len;
if (k === 0) return;
for (let i = 0; i < k; i++) {
let pre: number = nums[len - 1];
let next: number;
for (let j = 0; j < len; j++) {
next = nums[j];
nums[j] = pre;
pre = next;
}
}
};