Tc的专栏

待重头,收拾旧山河,朝天阙

LeetCode 112 Path Sum (DFS)

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.


题目链接:https://leetcode.com/problems/path-sum/


题目分析:直接深度优先搜索,记录当前和到叶子和sum比较即可

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    
    public boolean DFS(TreeNode root, int cur, int sum) {
        if (root.left == null && root.right == null) {
            cur += root.val;
            return cur == sum;
        }
        cur += root.val;
        if (root.left != null) {
            if (DFS(root.left, cur, sum)) {
                return true;
            }
        }
        if (root.right != null) {
            if (DFS(root.right, cur, sum)) {
                return true;
            }
        }
        return false;
    }
    
    public boolean hasPathSum(TreeNode root, int sum) {
        if (root == null) {
            return false;
        }
        return DFS(root, 0, sum);
    }
}


阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/Tc_To_Top/article/details/52431010
文章标签: leetcode DFS
个人分类: Leetcode Easy
所属专栏: LeetCode
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

加入CSDN,享受更精准的内容推荐,与500万程序员共同成长!
关闭
关闭