Path Sum I, II

简单题

Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.

For example:
Given the below binary tree and sum = 22,

              5/ \4   8/   / \11  13  4/  \      \7    2      1

return true, as there exist a root-to-leaf path 5->4->11->2 which sum is 22.

public class Solution {public boolean hasPathSum(TreeNode root, int sum) {if(root==null) return false;if(root.val==sum && root.left==null && root.right==null) return true;return (hasPathSum(root.left, sum-root.val) || hasPathSum(root.right, sum-root.val));}
}

Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.

For example:
Given the below binary tree and sum = 22,

              5/ \4   8/   / \11  13  4/  \    / \7    2  5   1

return

[[5,4,11,2],[5,8,4,5]
]

典型dfs题目

public class Solution {public ArrayList<ArrayList<Integer>> pathSum(TreeNode root, int sum) {ArrayList<ArrayList<Integer>> res = new ArrayList<ArrayList<Integer>>();ArrayList<Integer> cl = new ArrayList<Integer>();dfs(res, cl, root, sum);return res; }private void dfs(ArrayList<ArrayList<Integer>> res, ArrayList<Integer> cl,TreeNode n, int s ){if(n==null) return;cl.add(n.val);if(n.left==null && n.right==null && n.val==s){res.add(new ArrayList<Integer>(cl)); // if dont rebuild, will make conflict with the last line of cl.remove 哦！}else{if(n.left!=null)dfs(res, cl, n.left,s-n.val);if(n.right!=null)dfs(res, cl, n.right,s-n.val);}cl.remove(cl.size()-1);}
}

转载于:https://www.cnblogs.com/jiajiaxingxing/p/4565053.html

Path Sum I, II相关推荐

[LeetCode]113.Path Sum II
[题目] Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the giv ...
113. Path Sum II
/** 113. Path Sum II * 11.18 By Mingyang* 典型的backtracking,不过注意,这里的值可能是负数,所以不能用sum小于0来做任何判断* 1.长度标准:无 ...
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/ 题解简单的遍历二叉树,不解 ...
63. Unique Paths II and 64. Minimum Path Sum
文章目录 1 63 Unique Paths II 1.1 题目描述 1.2 动态规划解决 2 64. Minimum Path Sum 2.1 题目理解 2.2 动态规划这一遍刷dp的题目就很轻松 ...
Leetcode: mimimum depth of tree, path sum, path sum II
思路: 简单搜索总结: dfs 框架 1. 需要打印路径. 在 dfs 函数中假如 vector 变量, 不用 & 修饰的话就不需要 undo 2. 不需要打印路径, 可设置全局变量 ans ...
LeetCode 113. Path Sum II
113. Path Sum II Given a binary tree and a sum, find all root-to-leaf paths where each path's sum eq ...
Path Sum II leetcode java
题目: Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the give ...
[Leetcode] Path Sum II路径和
Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given 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 ...

Path Sum I, II

Path Sum I, II相关推荐

最新文章

热门文章