2020年6月4日
1365. How Many Numbers Are Smaller Than the Current Number
摘要： package LeetCode_1365 import java.util.* /** * 1365. How Many Numbers Are Smaller Than the Current Number * https://leetcode.com/problems/how-many-num 阅读全文
posted @ 2020-06-04 18:28 johnny_zhao 阅读(124) 评论(0) 推荐(0)
333. Largest BST Subtree
摘要： package LeetCode_333 import main.TreeNode /** * 333. Largest BST Subtree * Given a binary tree, find the largest subtree which is a Binary Search Tree 阅读全文
posted @ 2020-06-04 16:37 johnny_zhao 阅读(136) 评论(0) 推荐(0)
98. Validate Binary Search Tree
摘要： package LeetCode_98 import main.TreeNode /** * 98. Validate Binary Search Tree * https://leetcode.com/problems/validate-binary-search-tree/description 阅读全文
posted @ 2020-06-04 16:12 johnny_zhao 阅读(124) 评论(0) 推荐(0)
663. Equal Tree Partition
摘要： package LeetCode_663 import main.TreeNode import java.util.* /** * 663. Equal Tree Partition * (locked by leetcode) * https://www.lintcode.com/problem 阅读全文
posted @ 2020-06-04 14:10 johnny_zhao 阅读(193) 评论(0) 推荐(0)
814. Binary Tree Pruning
摘要： package LeetCode_814 /** * 814. Binary Tree Pruning * https://leetcode.com/problems/binary-tree-pruning/description/ * * We are given the head node ro 阅读全文
posted @ 2020-06-04 11:17 johnny_zhao 阅读(104) 评论(0) 推荐(0)
50. Pow(x, n)
摘要： package LeetCode_50 /** * 50. Pow(x, n) * https://leetcode.com/problems/powx-n/description/ * * Implement pow(x, n), which calculates x raised to the 阅读全文
posted @ 2020-06-04 00:30 johnny_zhao 阅读(97) 评论(0) 推荐(0)