Files
LeetCode-Go/leetcode/0724.Find-Pivot-Index/724. Find Pivot Index.go
halfrost bc7c289512 Merge pull request #52 from Janetyu/janetyu
finish 0724 solution
2020-08-20 08:06:38 +08:00

22 lines
329 B
Go

package leetcode
// 2 * leftSum + num[i] = sum
// 时间: O(n)
// 空间: O(1)
func pivotIndex(nums []int) int {
if len(nums) <= 0 {
return -1
}
var sum, leftSum int
for _, num := range nums {
sum += num
}
for index, num := range nums {
if leftSum*2+num == sum {
return index
}
leftSum += num
}
return -1
}