Commit 2e736b8

committed

update:888

1 parent e8837a6 commit 2e736b8Copy full SHA for 2e736b8

File tree

+35

-1

lines changed

+35

-1

lines changed

Lines changed: 5 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -43,3 +43,8 @@`
`43`	`43`	`链接:https://leetcode-cn.com/problems/fair-candy-swap`
`44`	`44`	`著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。`
`45`	`45`	```
	`46`	`+`
	`47`	`+根据题意,两边和相等,设A需要交换的为x,B需要交换的为y,则有`
	`48`	`+`
	`49`	`+>sumA-x+y=sumB-y+x`
	`50`	`+`

Lines changed: 30 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -1,9 +1,38 @@`
`1`	`1`	`package swap`
`2`	`2`
`3`		`-funcRun() {`
	`3`	`+import"fmt"`
`4`	`4`
	`5`	`+func Run() {`
	`6`	`+ A := []int{1, 2, 5}`
	`7`	`+ B := []int{2, 4}`
	`8`	`+ res := fairCandySwap(A, B)`
	`9`	`+ fmt.Println(res)`
`5`	`10`	`}`
`6`	`11`
`7`	`12`	`func fairCandySwap(A []int, B []int) []int {`
	`13`	`+ aSum := sum(A)`
	`14`	`+ bSum := sum(B)`
	`15`	`+ diff := aSum - bSum`
	`16`	`+`
	`17`	`+ res := make([]int, 2)`
	`18`	`+ checkB := make(map[int]bool, len(B))`
	`19`	`+ for _, i := range B {`
	`20`	`+ checkB[i] = true`
	`21`	`+ }`
	`22`	`+ for i := 0; i < len(A); i++ {`
	`23`	`+ res[0] = A[i]`
	`24`	`+ res[1] = A[i] - diff/2`
	`25`	`+ if checkB[res[1]] {`
	`26`	`+ return res`
	`27`	`+ }`
	`28`	`+ }`
`8`	`29`	`return nil`
`9`	`30`	`}`
	`31`	`+`
	`32`	`+func sum(arr []int) int {`
	`33`	`+ s := 0`
	`34`	`+ for _, i := range arr {`
	`35`	`+ s += i`
	`36`	`+ }`
	`37`	`+ return s`
	`38`	`+}`

Comments

(0)