leetcode 814. Binary Tree Pruning | 814. 二叉树剪枝(Java)
题目
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;}
}
leetcode 814. Binary Tree Pruning | 814. 二叉树剪枝(Java)相关推荐
- 814. Binary Tree Pruning(C语言)
814. Binary Tree Pruning(C语言) 深度优先搜索树 + 剪枝 题目 Given the root of a binary tree, return the same tree ...
- 814. Binary Tree Pruning
题目描述: We are given the head node root of a binary tree, where additionally every node's value is eit ...
- LeetCode 257. Binary Tree Paths (二叉树路径)
Given a binary tree, return all root-to-leaf paths. For example, given the following binary tree: 1/ ...
- leetcode103JAVA_[LeetCode] 103. Binary Tree Zigzag Level Order Traversal Java
题目: Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from lef ...
- 【二叉树的迭代版后序遍历】LeetCode 145. Binary Tree Postorder Traversal
LeetCode 145. Binary Tree Postorder Traversal Solution1:递归版答案 二叉树的后序遍历递归版是很简单的,关键是迭代版的代码既难理解又难写!但听了花 ...
- 【二叉树迭代版中序遍历】LeetCode 94. Binary Tree Inorder Traversal
LeetCode 94. Binary Tree Inorder Traversal Solution1:递归版 二叉树的中序遍历递归版是很简单的,中序遍历的迭代版需要特殊记一下! 迭代版链接:htt ...
- 【二叉树迭代版前序遍历】LeetCode 144. Binary Tree Preorder Traversal
LeetCode 144. Binary Tree Preorder Traversal Solution1:递归版 二叉树的前序遍历递归版是很简单的,前序遍历的迭代版相对是最容易理解的. 迭代版链接 ...
- LeetCode: Flatten Binary Tree to Linked List
LeetCode: Flatten Binary Tree to Linked List LeetCode: Flatten Binary Tree to Linked List Given a bi ...
- LeetCode 103. Binary Tree Zigzag Level Order Traversal
LeetCode 103. Binary Tree Zigzag Level Order Traversal Solution1:基于层次遍历的微改 /*** Definition for a bin ...
最新文章
- 从Wiesloch火车站到SAP Walldorf总部的交通方式
- Nacos(九)之Dubbo 融合 Nacos 成为注册中心
- 【CodeForces - 706C】Hard problem(dp,字典序)
- 14岁的男孩说想学生信,应该给予哪些指导?
- 023、JVM实战总结:一步一图:那JVM老年代垃圾回收器CMS工作时,内部又干了些啥?
- 阿里开源自研语音识别模型DFSMN 准确率高达96.04%
- Android Studio API 文档_下载与使用
- centos Install Docker
- @符号的几种用法总结
- Matlab实现均值滤波
- class和style绑定
- 创建maven项目时添加自定义property属性
- NPM安装依赖包,报错node-gyp rebuild...解决方法
- 滤波器测试系统|矢量网络分析仪滤波器测试软件NSAT-1000
- 计算机小高考成绩,2018江苏小高考成绩出来了!昆山*亮眼的学校是…
- [江枫]In Memory Undo与logical standby database
- PC能登录微信,但是不能访问网页/代理服务器没有响应
- 安徽阜阳计算机高中学校排名,安徽最强的五所高中,都是知名实力中学,考上就离名牌大学不远了!...
- Linux脚本开头#!/bin/bash和#!/bin/sh是什么意思以及区别
- js 万年历农历转阳历 方法_JS实现带阴历的日历功能详解
热门文章
- HDU - 5306 Gorgeous Sequence(吉司机线段树)
- UVA - 10480 Sabotage(最小割-最大流+输出割边)
- osqa java_从LSM-Tree、COLA-Tree谈到StackOverflow、OSQA(召唤前端)
- bootstrap php zend,Zend Framework教程之Bootstrap类用法概述
- rapidjson的read和write的sample
- 【Boost】boost库中智能指针——intrusive_ptr
- 对现有的所能找到个DDOS代码(攻击模块)做出一次分析----TCP篇
- 原始套接字与sniffer
- 使用MAP文件快速定位程序崩溃代码行
- 数据结构与算法 | 栈