112. Path Sum

原题链接：https://leetcode.com/problems/path-sum/description/
二叉树相关问题，直接深度优先搜索走一波：

/*** Created by clearbug on 2018/2/26.*/
public class Solution {static class TreeNode {int val;TreeNode left;TreeNode right;public TreeNode(int val) {this.val = val;}}public static void main(String[] args) {Solution s = new Solution();// test1TreeNode root = new TreeNode(3);root.left = new TreeNode(9);root.left.left = new TreeNode(33);root.right = new TreeNode(20);root.right.left = new TreeNode(15);root.right.right = new TreeNode(7);System.out.println(s.hasPathSum(root, 45));System.out.println(s.hasPathSum(root, 38));System.out.println(s.hasPathSum(root, 30));System.out.println(s.hasPathSum(root, 46));System.out.println(s.hasPathSum(root, 20));}public boolean hasPathSum(TreeNode root, int sum) {if (root == null) {return false;}return dfs(root, sum, 0);}private boolean dfs(TreeNode node, int sum, int currentSum) {currentSum += node.val;if (node.left == null && node.right == null) {if (currentSum == sum) {return true;}} else {if (node.left != null) {if (dfs(node.left, sum, currentSum)) {return true;}}if (node.right != null) {if (dfs(node.right, sum, currentSum)) {return true;}}}return false;}}

转载于:https://www.cnblogs.com/optor/p/8585521.html

112. Path Sum相关推荐

leetcode 112. Path Sum, 113. Path Sum II | 112,113. 路径总和 I, II（Java）
题目 https://leetcode.com/problems/path-sum/ https://leetcode.com/problems/path-sum-ii/ 题解简单的遍历二叉树,不解 ...
[勇者闯LeetCode] 112. Path Sum
[勇者闯LeetCode] 112. Path Sum Description Given a binary tree and a sum, determine if the tree has a r ...
Leetcode: 112. Path Sum
题目 Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up ...
Leet Code OJ 112. Path Sum [Difficulty: Easy]
题目: Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up ...
LeetCode 112. Path Sum
题目: Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up ...
leetcode python3 简单题112. Path Sum
1.编辑器我使用的是win10+vscode+leetcode+python3 环境配置参见我的博客: 链接 2.第一百一十二题 (1)题目英文: Given a binary tree and ...
112. Path Sum 路径总和
Title 给定一个二叉树和一个目标和,判断该树中是否存在根节点到叶子节点的路径,这条路径上所有节点值相加等于目标和. 说明: 叶子节点是指没有子节点的节点. 示例: 给定如下二叉树,以及目标和 su ...
[leetcode] Minimum Path Sum
Minimum Path Sum Given a m x n grid filled with non-negative numbers, find a path from top left to b ...
Leetcode | Binary Tree Maximum Path Sum
Given a binary tree, find the maximum path sum. The path may start and end at any node in the tree. ...

112. Path Sum

112. Path Sum相关推荐

最新文章

热门文章