-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathsolution724.go
More file actions
57 lines (46 loc) · 1.11 KB
/
solution724.go
File metadata and controls
57 lines (46 loc) · 1.11 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
package solution724
// ============================================================================
// 724. Find Pivot Index
// URL: https://leetcode.com/problems/find-pivot-index/
// ============================================================================
func pivotIndexV2(nums []int) int {
var total int
var leftSum int
for _, num := range nums {
total += num
}
for i, num := range nums {
if leftSum == total-leftSum-num {
return i
}
leftSum += num
}
return -1
}
func pivotIndex(nums []int) int {
if len(nums) <= 1 {
return 0
}
prefixSumL := make([]int, len(nums))
prefixSumL[0] = nums[0]
for i := 1; i < len(nums); i++ {
prefixSumL[i] = prefixSumL[i-1] + nums[i]
}
prefixSumR := make([]int, len(nums))
prefixSumR[len(prefixSumR)-1] = nums[len(nums)-1]
for i := len(nums) - 2; i >= 0; i-- {
prefixSumR[i] = prefixSumR[i+1] + nums[i]
}
for i := 0; i < len(nums); i++ {
if i == 0 && prefixSumR[i+1] == 0 {
return i
}
if i == len(nums)-1 && prefixSumL[i-1] == 0 {
return i
}
if i > 0 && i < len(nums)-1 && prefixSumL[i-1] == prefixSumR[i+1] {
return i
}
}
return -1
}