Commit4264f0a

Sathish Babu

committed

✨ Added solution to 532

1 parent0e82dfa commit4264f0aCopy full SHA for 4264f0a

File tree

+56

-12

lines changed

+56

-12

lines changed

Lines changed: 22 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -5,11 +5,31 @@`
`5`	`5`
`6`	`6`	`##Description`
`7`	`7`
	`8`	`+Given an array of integers and an integer k, you need to find the number of unique k-diff pairs in the array. Here a k-diff pair is defined as an integer pair (i, j), where i and j are both numbers in the array and their absolute difference is k.`
	`9`	`+`
`8`	`10`	`Example 1:`
`9`	`11`
`10`	`12`	```
`11`		`-Input: a = "11", b = "1"`
`12`		`-Output: "100"`
	`13`	`+Input: [3, 1, 4, 1, 5], k = 2`
	`14`	`+Output: 2`
	`15`	`+Explanation: There are two 2-diff pairs in the array, (1, 3) and (3, 5).`
	`16`	`+Although we have two 1s in the input, we should only return the number of unique pairs.`
	`17`	+```
	`18`	`+`
	`19`	`+Example 2:`
	`20`	`+`
	`21`	+```
	`22`	`+Input:[1, 2, 3, 4, 5], k = 1`
	`23`	`+Output: 4`
	`24`	`+Explanation: There are four 1-diff pairs in the array, (1, 2), (2, 3), (3, 4) and (4, 5).`
	`25`	+```
	`26`	`+`
	`27`	`+Example 3:`
	`28`	`+`
	`29`	+```
	`30`	`+Input: [1, 3, 1, 5, 4], k = 0`
	`31`	`+Output: 1`
	`32`	`+Explanation: There is one 0-diff pair in the array, (1, 1).`
`13`	`33`	```
`14`	`34`
`15`	`35`	`##题意`

Lines changed: 23 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,5 +1,26 @@`
`1`	`1`	`package Solution`
`2`	`2`
`3`		`-funcSolution(xbool)bool {`
`4`		`-returnx`
	`3`	`+funcSolution(nums []int,kint)int {`
	`4`	`+n:=len(nums)`
	`5`	`+ifn<2\|\|k<0 {`
	`6`	`+return0`
	`7`	`+}`
	`8`	`+hash,c:=make(map[int]int),0`
	`9`	`+for_,num:=rangenums {`
	`10`	`+hash[num]++`
	`11`	`+}`
	`12`	`+ifk==0 {`
	`13`	`+for_,v:=rangehash {`
	`14`	`+ifv>=2 {`
	`15`	`+c++`
	`16`	`+}`
	`17`	`+}`
	`18`	`+}else {`
	`19`	`+forkey:=rangehash {`
	`20`	`+ifhash[key+k]>0 {`
	`21`	`+c++`
	`22`	`+}`
	`23`	`+}`
	`24`	`+}`
	`25`	`+returnc`
`5`	`26`	`}`

Lines changed: 11 additions & 8 deletions

Original file line number	Diff line number	Diff line change
`@@ -10,21 +10,24 @@ func TestSolution(t *testing.T) {`
`10`	`10`	`//测试用例`
`11`	`11`	`cases:= []struct {`
`12`	`12`	`namestring`
`13`		`-inputsbool`
`14`		`-expectbool`
	`13`	`+nums []int`
	`14`	`+kint`
	`15`	`+expectint`
`15`	`16`	`}{`
`16`		`-{"TestCase",true,true},`
`17`		`-{"TestCase",true,true},`
`18`		`-{"TestCase",false,false},`
	`17`	`+{"TestCase", []int{3,1,4,1,5},2,2},`
	`18`	`+{"TestCase", []int{1,2,3,4,5},1,4},`
	`19`	`+{"TestCase", []int{1,3,1,5,4},0,1},`
	`20`	`+{"TestCase", []int{1,3,1,5,4},-1,0},`
	`21`	`+{"TestCase", []int{1},0,0},`
`19`	`22`	`}`
`20`	`23`
`21`	`24`	`//开始测试`
`22`	`25`	`fori,c:=rangecases {`
`23`	`26`	`t.Run(c.name+" "+strconv.Itoa(i),func(t*testing.T) {`
`24`		`-got:=Solution(c.inputs)`
	`27`	`+got:=Solution(c.nums,c.k)`
`25`	`28`	`if!reflect.DeepEqual(got,c.expect) {`
`26`		`-t.Fatalf("expected: %v, but got: %v, with inputs: %v",`
`27`		`-c.expect,got,c.inputs)`
	`29`	`+t.Fatalf("expected: %v, but got: %v, with inputs: %v %v",`
	`30`	`+c.expect,got,c.nums,c.k)`
`28`	`31`	`}`
`29`	`32`	`})`
`30`	`33`	`}`

Comments

(0)