摘要：
参考：https://leetcode.com/problems/flip-binary-tree-to-match-preorder-traversal/discuss/214216/JavaC%2B%2BPython-DFS-Solution 阅读全文
posted @ 2019-04-27 17:15
Sempron2800+
阅读(88)
评论(0)
推荐(0)
摘要：
1 class Solution { 2 3 private Map> memo; 4 5 public List allPossibleFBT(int N) { 6 this.memo = new HashMap(); 7 return backtrack(N); 8 } 9 10 ... 阅读全文
posted @ 2019-04-27 17:12
Sempron2800+
阅读(114)
评论(0)
推荐(0)
浙公网安备 33010602011771号