-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathDay 24.1.txt
55 lines (41 loc) · 1.16 KB
/
Day 24.1.txt
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. Rotate Array
Given an array, rotate the array to the right by k steps, where k is non-negative.
Example 1:
Input: nums = [1,2,3,4,5,6,7], 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]
Example 2:
Input: nums = [-1,-100,3,99], 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]
Constraints:
1 <= nums.length <= 105
-231 <= nums[i] <= 231 - 1
0 <= k <= 105
Follow up:
Try to come up with as many solutions as you can. There are at least three different ways to solve this problem.
Could you do it in-place with O(1) extra space?
class Solution {
public void rotate(int[] n, int k) {
int i,j=0;
k=k%n.length;
int a[]=new int[k];
for(i=n.length-k;i<n.length;i++)
{
a[j++]=n[i];
}
for(i=n.length-1;(i-k)>=0;i--)
{
n[i]=n[i-k];
}
for(i=0;i<j;i++)
{
n[i]=a[i];
}
}
}