Commit 9a5c65d

committed

Add: test case

1 parent b51545e commit 9a5c65dCopy full SHA for 9a5c65d

File tree

+13

-1

lines changed

+13

-1

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -13,7 +13,7 @@ import . "github.com/openset/leetcode/internal/kit"`
`13`	`13`	`func isCousins(root *TreeNode, x int, y int) bool {`
`14`	`14`	`xp, yp, xd, yd, depth := 0, 0, 0, 0, 0`
`15`	`15`	`queue := []*TreeNode{root}`
`16`		`- for l := len(queue); l > 0; l = len(queue) {`
	`16`	`+ for l := len(queue); l > 0&&xd==0&&yd==0; l = len(queue) {`
`17`	`17`	`for _, node := range queue {`
`18`	`18`	`if node.Left != nil {`
`19`	`19`	`if node.Left.Val == x {`

Lines changed: 12 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -33,6 +33,18 @@ func TestIsCousins(t *testing.T) {`
`33`	`33`	`y: 3,`
`34`	`34`	`expected: false,`
`35`	`35`	`},`
	`36`	`+ {`
	`37`	`+ input: []int{1, 2, 3, NULL, 4, 5},`
	`38`	`+ x: 4,`
	`39`	`+ y: 5,`
	`40`	`+ expected: true,`
	`41`	`+ },`
	`42`	`+ {`
	`43`	`+ input: []int{1, 2, 3, NULL, 4, 5},`
	`44`	`+ x: 5,`
	`45`	`+ y: 4,`
	`46`	`+ expected: true,`
	`47`	`+ },`
`36`	`48`	`}`
`37`	`49`	`for _, tc := range tests {`
`38`	`50`	`output := isCousins(SliceInt2TreeNode(tc.input), tc.x, tc.y)`

Comments

(0)