leetcode/ArithmeticSubarrays/arithmetic_subarrays.go at main · ayoubzulfiqar/leetcode · GitHub

Name: leetcode/ArithmeticSubarrays/arithmetic_subarrays.go at main · ayoubzulfiqar/leetcode · GitHub
Rating: 4.4 (3337 reviews)
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
package main

import"math"

funccheckArithmeticSubarrays(nums []int, l []int, r []int) []bool {
varans []bool

fori:=0; i<len(l); i++ {
min:=math.MaxInt32
max:=math.MinInt32
length:=r[i] -l[i] +1

forj:=l[i]; j<=r[i]; j++ {
min=int(math.Min(float64(min), float64(nums[j])))
max=int(math.Max(float64(max), float64(nums[j])))
 }

ifmin==max {
ans=append(ans, true)
 } elseif (max-min)%(length-1) !=0 {
ans=append(ans, false)
 } else {
diff:=make([]bool, length)

step:= (max-min) / (length-1)
j:=l[i]

forj<=r[i] {
if (nums[j]-min)%step!=0||diff[(nums[j]-min)/step] {
break
 }

diff[(nums[j]-min)/step] =true
j++
 }

ans=append(ans, j>r[i])
 }
 }

returnans
}


/*


func isArithmetic(nums []int, ll, rr int) bool {
 minN := nums[ll]
 maxN := nums[ll]
 for i := ll; i <= rr; i++ {
 if nums[i] < minN {
 minN = nums[i]
 }
 if nums[i] > maxN {
 maxN = nums[i]
 }
 }
 diff := maxN - minN
 if diff == 0 {
 return true
 }
 d := diff / (rr - ll)
 if diff%(rr-ll) != 0 {
 return false
 }
 term := make([]bool, rr-ll+1)
 for i := ll; i <= rr; i++ {
 x := nums[i] - minN
 if x%d != 0 {
 return false
 }
 j := x / d
 if term[j] {
 return false // exact once
 } else {
 term[j] = true
 }
 }
 return true
}

func checkArithmeticSubarrays(nums []int, l, r []int) []bool {
 m := len(l)
 ans := make([]bool, m)
 for i := 0; i < m; i++ {
 ans[i] = isArithmetic(nums, l[i], r[i])
 }
 return ans
}


*/