-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy path2582_Pass_the_Pillow.cpp
More file actions
59 lines (59 loc) · 1.72 KB
/
2582_Pass_the_Pillow.cpp
File metadata and controls
59 lines (59 loc) · 1.72 KB
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
/*
2582. Pass the Pillow
There are n people standing in a line labeled from 1 to n. The first person in the line is holding a pillow initially. Every second, the person holding the pillow passes it to the next person standing in the line. Once the pillow reaches the end of the line, the direction changes, and people continue passing the pillow in the opposite direction.
For example, once the pillow reaches the nth person they pass it to the n - 1th person, then to the n - 2th person and so on.
Given the two positive integers n and time, return the index of the person holding the pillow after time seconds.
Example 1:
Input: n = 4, time = 5
Output: 2
Explanation: People pass the pillow in the following way: 1 -> 2 -> 3 -> 4 -> 3 -> 2.
After five seconds, the 2nd person is holding the pillow.
Example 2:
Input: n = 3, time = 2
Output: 3
Explanation: People pass the pillow in the following way: 1 -> 2 -> 3.
After two seconds, the 3rd person is holding the pillow.
Constraints:
2 <= n <= 1000
1 <= time <= 1000
*/
/*
MOST OPTIMZED APPROACH
Time Complexity O(N)
Space Complexity O(1)
*/
class Solution {
public:
int passThePillow(int n, int time) {
int newTime = time % (2*(n-1));
if(newTime>=n-1){
return n-(newTime-(n-1));
}
else{
return 1+newTime;
}
}
};
/*
MOST OPTIMZED APPROACH
Time Complexity O(N)
Space Complexity O(1)
*/
class Solution {
public:
int passThePillow(int n, int time) {
bool lToR = 1;
int a = 1;
while(time--){
if(lToR){
a++;
if(a==n) lToR =0;
}
else{
a--;
if(a==1) lToR = 1;
}
}
return a;
}
};