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

fix/199: clean up redundant code

Browse Source
This commit is contained in:
novahe
2021-06-01 22:52:00 +08:00
parent 3dac8b9e82
commit 9e357544d1
2 changed files with 24 additions and 44 deletions
Download Patch File Download Diff File Expand all files Collapse all files

34
leetcode/0199.Binary-Tree-Right-Side-View/199. Binary Tree Right Side View.go
View File

@ -17,33 +17,23 @@ type TreeNode = structures.TreeNode
*/
func rightSideView(root *TreeNode) []int {
res := []int{}
if root == nil {
return []int{}
return res
}
queue := []*TreeNode{}
queue = append(queue, root)
curNum, nextLevelNum, res, tmp := 1, 0, []int{}, []int{}
for len(queue) != 0 {
if curNum > 0 {
node := queue[0]
if node.Left != nil {
queue = append(queue, node.Left)
nextLevelNum++
queue := []*TreeNode{root}
for len(queue) > 0 {
n := len(queue)
for i := 0; i < n; i++ {
if queue[i].Left != nil {
queue = append(queue, queue[i].Left)
}
if node.Right != nil {
queue = append(queue, node.Right)
nextLevelNum++
if queue[i].Right != nil {
queue = append(queue, queue[i].Right)
}
curNum--
tmp = append(tmp, node.Val)
queue = queue[1:]
}
if curNum == 0 {
res = append(res, tmp[len(tmp)-1])
curNum = nextLevelNum
nextLevelNum = 0
tmp = []int{}
}
res = append(res, queue[n-1].Val)
queue = queue[n:]
}
return res
}

34
website/content/ChapterFour/0100~0199/0199.Binary-Tree-Right-Side-View.md
View File

@ -50,33 +50,23 @@ package leetcode
* }
*/
func rightSideView(root *TreeNode) []int {
res := []int{}
if root == nil {
return []int{}
return res
}
queue := []*TreeNode{}
queue = append(queue, root)
curNum, nextLevelNum, res, tmp := 1, 0, []int{}, []int{}
for len(queue) != 0 {
if curNum > 0 {
node := queue[0]
if node.Left != nil {
queue = append(queue, node.Left)
nextLevelNum++
queue := []*TreeNode{root}
for len(queue) > 0 {
n := len(queue)
for i := 0; i < n; i++ {
if queue[i].Left != nil {
queue = append(queue, queue[i].Left)
}
if node.Right != nil {
queue = append(queue, node.Right)
nextLevelNum++
if queue[i].Right != nil {
queue = append(queue, queue[i].Right)
}
curNum--
tmp = append(tmp, node.Val)
queue = queue[1:]
}
if curNum == 0 {
res = append(res, tmp[len(tmp)-1])
curNum = nextLevelNum
nextLevelNum = 0
tmp = []int{}
}
res = append(res, queue[n-1].Val)
queue = queue[n:]
}
return res
}