-
Notifications
You must be signed in to change notification settings - Fork 1
/
seat.go
58 lines (54 loc) · 1.06 KB
/
seat.go
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
package seat
import "github.com/catorpilor/leetcode/utils"
func maxDist(seats []int) int {
return useStraight(seats)
}
// useStraight time complexity O(N), space complexity O(1)
func useStraight(seats []int) int {
n := len(seats)
var ans, leftZero, prevOne int
leftZero, prevOne = -1, -1
for i := 0; i < n; i++ {
if seats[i] == 1 {
if leftZero != -1 {
var cur int
if prevOne == -1 {
cur = i - leftZero
} else {
cur = (i - prevOne) >> 1
}
ans = utils.Max(ans, cur)
}
leftZero = -1
prevOne = i
continue
}
// seats[i] = 0 here
if leftZero == -1 {
leftZero = i
}
}
if leftZero != -1 {
// seats end with 0, for example [1,0,0,0,0]
ans = utils.Max(ans, n-1-prevOne)
}
return ans
}
// useOnepass time complexity O(N), space complexity O(1w)
func useOnepass(seats []int) int {
n := len(seats)
last := -1
var ans int
for i := 0; i < n; i++ {
if seats[i] == 1 {
if last < 0 {
ans = i
} else {
ans = utils.Max(ans, (i-last)>>1)
}
last = i
}
}
ans = utils.Max(ans, n-1-last)
return ans
}