mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 19:53:12 +08:00
41 lines
1.5 KiB
HTML
41 lines
1.5 KiB
HTML
<p>Given the <code>root</code> of a binary tree and an integer <code>targetSum</code>, return <code>true</code> if the tree has a <strong>root-to-leaf</strong> path such that adding up all the values along the path equals <code>targetSum</code>.</p>
|
|
|
|
<p>A <strong>leaf</strong> is a node with no children.</p>
|
|
|
|
<p> </p>
|
|
<p><strong>Example 1:</strong></p>
|
|
<img alt="" src="https://assets.leetcode.com/uploads/2021/01/18/pathsum1.jpg" style="width: 500px; height: 356px;" />
|
|
<pre>
|
|
<strong>Input:</strong> root = [5,4,8,11,null,13,4,7,2,null,null,null,1], targetSum = 22
|
|
<strong>Output:</strong> true
|
|
<strong>Explanation:</strong> The root-to-leaf path with the target sum is shown.
|
|
</pre>
|
|
|
|
<p><strong>Example 2:</strong></p>
|
|
<img alt="" src="https://assets.leetcode.com/uploads/2021/01/18/pathsum2.jpg" />
|
|
<pre>
|
|
<strong>Input:</strong> root = [1,2,3], targetSum = 5
|
|
<strong>Output:</strong> false
|
|
<strong>Explanation:</strong> There two root-to-leaf paths in the tree:
|
|
(1 --> 2): The sum is 3.
|
|
(1 --> 3): The sum is 4.
|
|
There is no root-to-leaf path with sum = 5.
|
|
</pre>
|
|
|
|
<p><strong>Example 3:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> root = [], targetSum = 0
|
|
<strong>Output:</strong> false
|
|
<strong>Explanation:</strong> Since the tree is empty, there are no root-to-leaf paths.
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li>The number of nodes in the tree is in the range <code>[0, 5000]</code>.</li>
|
|
<li><code>-1000 <= Node.val <= 1000</code></li>
|
|
<li><code>-1000 <= targetSum <= 1000</code></li>
|
|
</ul>
|