FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
leetcode/algorithms/cpp/rotateArray/rotateArray.cpp at master · openhardnudd/leetcode · GitHub
openhardnudd
/
leetcode
Public
forked from
haoel/leetcode
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Pull requests
0
Actions
Projects
Wiki
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Projects
Wiki
Security and quality
Insights
Expand file tree
Breadcrumbs
leetcode
/
algorithms
/
cpp
/
rotateArray
/
rotateArray.cpp
Copy path
More file actions
More file actions
Latest commit
History
History
History
123 lines (102 loc) · 2.81 KB
Breadcrumbs
leetcode
/
algorithms
/
cpp
/
rotateArray
/
rotateArray.cpp
Copy path
File metadata and controls
123 lines (102 loc) · 2.81 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
//
Source : https://leetcode.com/problems/rotate-array/
//
Author : Hao Chen
//
Date : 2015-03-30
/*
*********************************************************************************
*
* 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.
*
* Hint:
* Could you do it in-place with O(1) extra space?
*
* Related problem: Reverse Words in a String II
*
* Credits:Special thanks to @Freezen for adding this problem and creating all test cases.
*
*********************************************************************************
*/
#
include
<
stdlib.h
>
#
include
<
time.h
>
#
include
<
iostream
>
using
namespace
std
;
void
reverseArray
(
int
nums[],
int
start,
int
end){
int
temp;
while
(start < end){
int
temp = nums[start];
nums[start++] = nums[end];
nums[end--] = temp;
}
}
/*
* this solution is so-called three times rotate method
* because (X^TY^T)^T = YX, so we can perform rotate operation three times to get the result
* obviously, the algorithm consumes O(1) space and O(n) time
*/
void
rotate1
(
int
nums[],
int
n,
int
k) {
if
(k<=
0
)
return
;
k %= n;
reverseArray
(nums, n-k, n-
1
);
reverseArray
(nums,
0
, n-k-
1
);
reverseArray
(nums,
0
, n-
1
);
}
/*
* How to change [0,1,2,3,4,5,6] to [4,5,6,0,1,2,3] by k = 3?
*
* We can change by following rules:
*
* [0]->[3], [3]->[6], [6]->[2], [2]->[5], [5]->[1], [1]->[4]
*
*
*/
void
rotate2
(
int
nums[],
int
n,
int
k) {
if
(k<=
0
)
return
;
k %= n;
int
currIdx=
0
, newIdx=k;
int
tmp1 = nums[currIdx], tmp2;
int
origin =
0
;
for
(
int
i=
0
; i<n; i++){
tmp2 = nums[newIdx];
nums[newIdx] = tmp1;
tmp1 = tmp2;
currIdx = newIdx;
//
if we meet a circle, move the next one
if
(origin == currIdx) {
origin = ++currIdx;
tmp1 = nums[currIdx];
}
newIdx = (currIdx + k) % n;
}
}
void
rotate
(
int
nums[],
int
n,
int
k) {
if
(
random
()%
2
==
0
) {
cout <<
"
[1]
"
;
return
rotate1
(nums, n, k);
}
cout <<
"
[2]
"
;
return
rotate2
(nums, n, k);
}
void
printArray
(
int
nums[],
int
n) {
cout <<
"
[
"
;
for
(
int
i=
0
; i<n; i++) {
cout << nums[i] << ((i==n-
1
)?
"
"
:
"
,
"
);
}
cout <<
"
]
"
<< endl;
}
void
initArray
(
int
nums[],
int
n) {
for
(
int
i=
0
; i<n; i++) {
nums[i] = i;
}
}
int
main
(
int
argc,
char
**argv) {
srand
(
time
(
0
));
int
nums[] = {
0
,
1
,
2
,
3
,
4
,
5
,
6
,
7
,
8
,
9
};
const
int
n =
sizeof
(nums)/
sizeof
(
int
);
for
(
int
i=
0
; i<n; i++) {
initArray
(nums, n);
rotate
(nums, n, i);
printArray
(nums, n);
}
return
0
;
}
Back
|
FazBrowse Home
|
New Git URL