題目

https://leetcode.com/problems/binary-tree-pruning/

題解

思路很簡單，看草稿：

/*** Definition for a binary tree node.* public class TreeNode {* int val;* TreeNode left;* TreeNode right;* TreeNode() {}* TreeNode(int val) { this.val = val; }* TreeNode(int val, TreeNode left, TreeNode right) {* this.val = val;* this.left = left;* this.right = right;* }* }*/ class Solution {public TreeNode pruneTree(TreeNode root) {if (retain(root)) return root;else return null;}public boolean retain(TreeNode node) {if (node == null) return false;boolean l = retain(node.left);boolean r = retain(node.right);if (!l) node.left = null;if (!r) node.right = null;return l || r || node.val == 1;} }

超強干貨來襲 云風專訪：近40年碼齡，通宵達旦的技術人生

總結

以上是生活随笔為你收集整理的leetcode 814. Binary Tree Pruning | 814. 二叉树剪枝（Java）的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。