제목 : https://leetcode-cn.com/problems/path-sum/
대답:
public boolean hasPathSum (TreeNode root, int sum) {
if (root == null) false 반환;
return cal (root, sum);
}
public boolean cal (TreeNode root, int sum) {
if (root.left == null) {
if (root.right == null) {
return sum-root.val == 0;
}그밖에{
return cal (root.right, sum-root.val);
}
}그밖에{
if (root.right == null) {
return cal (root.left, sum-root.val);
}그밖에{
부울 왼쪽 = cal (root.left, sum-root.val);
부울 오른쪽 = cal (root.right, sum-root.val);
왼쪽으로 돌아와 || 권리;
}
}
}