Commit72ceaf9

Sathish Babu

committed

✨ Added solution to 724

1 parent5819cbb commit72ceaf9Copy full SHA for 72ceaf9

File tree

+43

-9

lines changed

+43

-9

lines changed

Lines changed: 20 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -5,11 +5,29 @@`
`5`	`5`
`6`	`6`	`##Description`
`7`	`7`
	`8`	`+Given an array of integers nums, write a method that returns the "pivot" index of this array.`
	`9`	`+`
	`10`	`+We define the pivot index as the index where the sum of all the numbers to the left of the index is equal to the sum of all the numbers to the right of the index.`
	`11`	`+`
	`12`	`+If no such index exists, we should return -1. If there are multiple pivot indexes, you should return the left-most pivot index.`
	`13`	`+`
`8`	`14`	`Example 1:`
`9`	`15`
`10`	`16`	```
`11`		`-Input: a = "11", b = "1"`
`12`		`-Output: "100"`
	`17`	`+Input: nums = [1,7,3,6,5,6]`
	`18`	`+Output: 3`
	`19`	`+Explanation:`
	`20`	`+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.`
	`21`	`+Also, 3 is the first index where this occurs.`
	`22`	+```
	`23`	`+`
	`24`	`+Example 2:`
	`25`	`+`
	`26`	+```
	`27`	`+Input: nums = [1,2,3]`
	`28`	`+Output: -1`
	`29`	`+Explanation:`
	`30`	`+There is no index that satisfies the conditions in the problem statement.`
`13`	`31`	```
`14`	`32`
`15`	`33`	`##题意`

Lines changed: 18 additions & 2 deletions

Lines changed: 5 additions & 5 deletions

Original file line number	Diff line number	Diff line change
`@@ -10,12 +10,12 @@ func TestSolution(t *testing.T) {`
`10`	`10`	`//测试用例`
`11`	`11`	`cases:= []struct {`
`12`	`12`	`namestring`
`13`		`-inputsbool`
`14`		`-expectbool`
	`13`	`+inputs[]int`
	`14`	`+expectint`
`15`	`15`	`}{`
`16`		`-{"TestCase",true,true},`
`17`		`-{"TestCase",true,true},`
`18`		`-{"TestCase",false,false},`
	`16`	`+{"TestCase",[]int{1,7,3,6,5,6},3},`
	`17`	`+{"TestCase",[]int{1,2,3},-1},`
	`18`	`+{"TestCase",[]int{},-1},`
`19`	`19`	`}`
`20`	`20`
`21`	`21`	`//开始测试`

Comments

(0)