894. All Possible Full Binary Trees(所有可能的完美二叉树)

题目描述 方法思路 class Solution { //Runtime: 3 ms, faster than 95.78% //Memory Usage: 44 MB, less than 68.95% Map<Integer, List<TreeNode>> memo = new HashMap(); public List<TreeNode> allPoss
相关文章
相关标签/搜索