版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/qq_27068845/article/details/84759895
Introduction
Given an array of integers nums, write a method that returns the “pivot” index of this array.
We define the pivot index as the index where the sum of the numbers to the left of the index is equal to the sum of the numbers to the right of the index.
If no such index exists, we should return -1. If there are multiple pivot indexes, you should return the left-most pivot index.
Example 1:
Input:
nums = [1, 7, 3, 6, 5, 6]
Output: 3
Explanation:
The sum of the numbers to the left of index 3 (nums[3] = 6) is equal to the sum of numbers to the right of index 3.
Also, 3 is the first index where this occurs.
Example 2:
Input:
nums = [1, 2, 3]
Output: -1
Explanation:
There is no index that satisfies the conditions in the problem statement.
Note:
The length of nums will be in the range [0, 10000].
Each element nums[i] will be an integer in the range [-1000, 1000].
code
package main
import (
"fmt"
)
func FindPivotIndex(nums []int) int {
var (
pivot = 0
leftSum = 0 // 从pivot往左的所有数之和
rightSum = 0 // 从pivot往右的所有数之和
isFound = false // 是否找到
)
// 假定pivot在列表头
// 此时 pivot=0 leftSum=0 rightSum=?
for i := 1; i < len(nums); i++ {
rightSum += nums[i]
}
//
for !isFound {
if leftSum == rightSum {
isFound = true
break
}
pivot++
if pivot == len(nums) {
break
}
leftSum += nums[pivot-1]
rightSum -= nums[pivot]
}
if isFound {
return pivot
} else {
return -1
}
}
Test
package main
import (
. "github.com/smartystreets/goconvey/convey"
"testing"
)
type Case struct {
*testing.T
Name string
Nums []int
ExpectPivot int
}
func (c *Case) TestFindPivotIndex() {
Convey(c.Name, c.T, func() {
So(FindPivotIndex(c.Nums), ShouldEqual, c.ExpectPivot)
})
}
func TestFindPivotIndex(t *testing.T) {
c := Case{
t,
"Example 1 : input=[1, 7, 3, 6, 5, 6] output=3",
[]int{1, 7, 3, 6, 5, 6},
3,
}
c.TestFindPivotIndex()
c2 := Case{
t,
"Example 2 : input=[1, 2, 3] output=-1",
[]int{1, 2, 3},
-1,
}
c2.TestFindPivotIndex()
}