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

Merge pull request #60 from halfrost/code_quality_improvement

Browse Source 
optimization code quality level from A to A+
This commit is contained in:
halfrost
2020-08-27 01:07:57 +08:00
committed by YDZ
parent 7b7307761c 96c36de45b
commit d2dfc2d634
543 changed files with 2449 additions and 2396 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
leetcode/0095.Unique-Binary-Search-Trees-II/95. Unique Binary Search Trees II.go
View File

@ -29,10 +29,9 @@ func generateBSTree(start, end int) []*TreeNode {
tree = append(tree, nil)
return tree
}
left, right := []*TreeNode{}, []*TreeNode{}
for i := start; i <= end; i++ {
left = generateBSTree(start, i-1)
right = generateBSTree(i+1, end)
left := generateBSTree(start, i-1)
right := generateBSTree(i+1, end)
for _, l := range left {
for _, r := range right {
root := &TreeNode{Val: i, Left: l, Right: r}

16
leetcode/0095.Unique-Binary-Search-Trees-II/95. Unique Binary Search Trees II_test.go
View File

@ -28,19 +28,19 @@ func Test_Problem95(t *testing.T) {
qs := []question95{
question95{
{
para95{1},
ans95{[]*TreeNode{&TreeNode{Val: 1, Left: nil, Right: nil}}},
ans95{[]*TreeNode{{Val: 1, Left: nil, Right: nil}}},
},
question95{
{
para95{3},
ans95{[]*TreeNode{
&TreeNode{Val: 1, Left: nil, Right: &TreeNode{Val: 3, Left: &TreeNode{Val: 2, Left: nil, Right: nil}, Right: nil}},
&TreeNode{Val: 1, Left: nil, Right: &TreeNode{Val: 2, Left: nil, Right: &TreeNode{Val: 3, Left: nil, Right: nil}}},
&TreeNode{Val: 3, Left: &TreeNode{Val: 2, Left: &TreeNode{Val: 1, Left: nil, Right: nil}, Right: nil}, Right: nil},
&TreeNode{Val: 3, Left: &TreeNode{Val: 1, Left: nil, Right: &TreeNode{Val: 2, Left: nil, Right: nil}}, Right: nil},
&TreeNode{Val: 2, Left: &TreeNode{Val: 1, Left: nil, Right: nil}, Right: &TreeNode{Val: 3, Left: nil, Right: nil}},
{Val: 1, Left: nil, Right: &TreeNode{Val: 3, Left: &TreeNode{Val: 2, Left: nil, Right: nil}, Right: nil}},
{Val: 1, Left: nil, Right: &TreeNode{Val: 2, Left: nil, Right: &TreeNode{Val: 3, Left: nil, Right: nil}}},
{Val: 3, Left: &TreeNode{Val: 2, Left: &TreeNode{Val: 1, Left: nil, Right: nil}, Right: nil}, Right: nil},
{Val: 3, Left: &TreeNode{Val: 1, Left: nil, Right: &TreeNode{Val: 2, Left: nil, Right: nil}}, Right: nil},
{Val: 2, Left: &TreeNode{Val: 1, Left: nil, Right: nil}, Right: &TreeNode{Val: 3, Left: nil, Right: nil}},
}}},
}