-
Notifications
You must be signed in to change notification settings - Fork 1
Issues: Sogrey/Python-QA
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.
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
Author
Label
Projects
Milestones
Assignee
Sort
Issues list
输入一棵二叉树和一个整数,打印出二叉树中结点值的和为输入整数的所有路径。路径定义为从树的根结点开始往下一直到叶结点所经过的结点形成一条路径。
算法
#143
opened Feb 22, 2020 by
Sogrey
求出1~13的整数中1出现的次数,共6次,包含1的整数是1、10、11、12、13。那么如何求出小于等于n的非负整数区间一共包含多少个1呢?
算法
#142
opened Feb 22, 2020 by
Sogrey
Previous Next
ProTip!
Mix and match filters to narrow down what you’re looking for.