一、题目内容

image.png

二、题解

解法1：

思路

代码

  1. public class Solution {
  3.     boolean has = false;
  4.     public boolean hasPathSum (TreeNode root, int sum) {
  5.         // write code here
  6.         recur(root, sum);
  7.         return has;
  8.     }
  10.     private void recur(TreeNode root, int sum){
  11.         if (root == null) {
  12.             return;
  13.         }
  14.         sum -= root.val;
  15.         if(sum == 0 && root.left == null && root.right == null){
  16.             has = true;
  17.             return;
  18.         }
  19.         recur(root.left, sum);
  20.         recur(root.right, sum);
  21.     }
  22. }