Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

[bug][{python}] {maximum-sum-bst-in-binary-tree} #1471

Open
2 tasks done
libra146 opened this issue Aug 17, 2023 · 0 comments · May be fixed by #1472
Open
2 tasks done

[bug][{python}] {maximum-sum-bst-in-binary-tree} #1471

libra146 opened this issue Aug 17, 2023 · 0 comments · May be fixed by #1472
Labels
help wanted Extra attention is needed

Comments

@libra146
Copy link

请在提交 bug 之前先搜索

  • 我已经搜索过 issues，没有发现相同的 bug。

出错的题目链接

https://leetcode.cn/problems/maximum-sum-bst-in-binary-tree

报错信息

一共两个问题，一个是语法错误，python 不能使用 /后序遍历位置/这种块注释
另一个问题是找不到traverse函数，应该是findMaxMinSum函数

SyntaxError: invalid syntax
    ^
    /*******后序遍历位置*******/
Line 22  (Solution.py)

AttributeError: 'Solution' object has no attribute 'traverse'
    self.traverse(root)
Line 10 in maxSumBST (Solution.py)
    ret = Solution().maxSumBST(param_1)
Line 62 in _driver (Solution.py)
    _driver()
Line 73 in <module> (Solution.py)

你是否愿意提交 PR 修复这个 bug？

  • 我愿意！
@libra146 libra146 added the help wanted Extra attention is needed label Aug 17, 2023
@libra146 libra146 linked a pull request Aug 17, 2023 that will close this issue
Open
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
help wanted Extra attention is needed
Projects
None yet
Milestone
No milestone
Development

Successfully merging a pull request may close this issue.

[fix][python]maximum-sum-bst-in-binary-tree libra146/fucking-algorithm
1 participant
@libra146