algorithm/LeetCode-Go
1
0
Fork 0
mirror of https://github.com/halfrost/LeetCode-Go.git synced 2025-07-05 00:25:22 +08:00
Code Issues Packages Projects Releases Wiki Activity

optimization code level from A to A+

Browse Source
This commit is contained in:
YDZ
2020-08-26 23:43:03 +08:00
parent 7b7307761c
commit 96c36de45b
519 changed files with 2341 additions and 2322 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
leetcode/1305.All-Elements-in-Two-Binary-Search-Trees/1305. All Elements in Two Binary Search Trees_test.go
View File

@ -29,27 +29,27 @@ func Test_Problem1305(t *testing.T) {
qs := []question1305{
question1305{
{
para1305{[]int{2, 1, 4}, []int{1, 0, 3}},
ans1305{[]int{0, 1, 1, 2, 3, 4}},
},
question1305{
{
para1305{[]int{0, -10, 10}, []int{5, 1, 7, 0, 2}},
ans1305{[]int{-10, 0, 0, 1, 2, 5, 7, 10}},
},
question1305{
{
para1305{[]int{}, []int{5, 1, 7, 0, 2}},
ans1305{[]int{0, 1, 2, 5, 7}},
},
question1305{
{
para1305{[]int{0, -10, 10}, []int{}},
ans1305{[]int{-10, 0, 10}},
},
question1305{
{
para1305{[]int{1, structures.NULL, 8}, []int{8, 1}},
ans1305{[]int{1, 1, 8, 8}},
},