-
Notifications
You must be signed in to change notification settings - Fork 0
/
189_rotate_array.java
77 lines (66 loc) · 2.2 KB
/
189_rotate_array.java
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
// Solution 1: My own solution
class Solution {
public void rotate(int[] nums, int k) {
if (nums.length <= 1) {
return ;
}
int start = nums.length - k % nums.length;
if (start == nums.length) {
return ;
}
int[] temp = new int[nums.length];
for (int i = 0; i < nums.length; i++) {
temp[i] = nums[i];
}
for (int i = 0; i < nums.length; i++) {
nums[i] = temp[start];
start = (start + 1) % nums.length;
}
}
}
// Solution 2: official solution 1
class Solution {
public void rotate(int[] nums, int k) {
int[] ans = new int[nums.length];
for (int i = 0; i < nums.length; i++) {
ans[(i+k) % nums.length] = nums[i];
}
System.arraycopy(ans, 0, nums, 0, nums.length);
}
}
// Solution 3: official solution 3
class Solution {
private void reverse(int[] nums, int start, int end) {
int temp = 0;
while (start < end) {
temp = nums[start];
nums[start] = nums[end];
nums[end] = temp;
start++;
end--;
}
}
public void rotate(int[] nums, int k) {
reverse(nums, 0, nums.length-1);
reverse(nums, 0, k % nums.length -1);
reverse(nums, k % nums.length, nums.length-1);
}
}
/**
* This is my personal record of solving Leetcode Problems.
* If you have any questions, please discuss them in [Issues](https://github.com/mengxinayan/leetcode/issues).
* Copyright (C) 2020-2022 mengxinayan
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/