Skip to content

Latest commit

 

History

History
110 lines (79 loc) · 1.76 KB

0113-path-sum-ii.adoc

File metadata and controls

110 lines (79 loc) · 1.76 KB

113. Path Sum II

{leetcode}/problems/path-sum-ii/[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 sum.

Note: A leaf is a node with no children.

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]
]

解题分析

利用回溯+深度优先搜索即可解决。

这样要重点注意的是：回溯时，前进和后退要成对出现。

Tip
 非常典型的回溯问题！
{image_attr}
{image_attr}
{image_attr}
{image_attr}
{image_attr}
{image_attr}
{image_attr}
{image_attr}
{image_attr}
{image_attr}
{image_attr}
{image_attr}
一刷
link:{sourcedir}/_0113_PathSumII.java[role=include]
二刷（待优化）
link:{sourcedir}/_0113_PathSumII_2.java[role=include]
二刷（优化）
link:{sourcedir}/_0113_PathSumII_21.java[role=include]
三刷
link:{sourcedir}/_0113_PathSumII_3.java[role=include]