반응형
리트코드 dfs
-
[Algorithm] LeetCode - 113. Path Sum II (DFS)Alogorithm 2022. 2. 13. 19:48
LeetCode 문제입니다. [문제설명] Given the root of a binary tree and an integer targetSum, return all root-to-leaf paths where the sum of the node values in the path equals targetSum. Each path should be returned as a list of the node values, not node references. A root-to-leaf path is a path starting from the root and ending at any leaf node. A leaf is a node with no children. 번역) Binary Tree의 root와 정수 t..