摘要：
https://leetcode.com/problems/search-in-a-binary-search-tree/ Given the root node of a binary search tree (BST) and a value. You need to find the node 阅读全文
posted @ 2018-12-10 15:19
_Zlrrr
阅读(144)
评论(0)
推荐(0)
摘要：
在学习二叉树的过程中按照书上打出来的代码 记下来要经常看看 希望我和我的树玩得开心 :-) ①二叉搜索树的插入删除搜索输出 #include <bits/stdc++.h> using namespace std; struct Node { int key; Node *left, *right, 阅读全文
posted @ 2018-12-10 15:01
_Zlrrr
阅读(277)
评论(0)
推荐(0)
摘要：
https://leetcode.com/problems/maximum-depth-of-binary-tree/ Given a binary tree, find its maximum depth. The maximum depth is the number of nodes alon 阅读全文
posted @ 2018-12-10 14:47
_Zlrrr
阅读(116)
评论(0)
推荐(0)
摘要：
https://leetcode.com/problems/integer-to-roman/ Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M. For example, two is 阅读全文
posted @ 2018-12-10 14:38
_Zlrrr
阅读(150)
评论(0)
推荐(0)
摘要：
1091 N-自守数 代码： #include <bits/stdc++.h> using namespace std; int T; int A(int a) { int cnt = 0; while(a) { a /= 10; cnt ++; } return cnt; } int Pow(in 阅读全文
posted @ 2018-12-10 13:20
_Zlrrr
阅读(1585)
评论(3)
推荐(1)
浙公网安备 33010602011771号