[Leetcode] (python): 113 Path Sum II

Source: Internet
Author: User

Source of the topic

https://leetcode.com/problems/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.

Test instructions Analysis

input:a binary tree, sum

Output:list of the list.

Conditions: Given a binary tree, returns the path value of all root-leaf and the path equal to sum.

Topic ideas

Passed through a valuelist. DFS recursion

AC Code (PYTHON)

1 #Definition for a binary tree node.2 #class TreeNode (object):3 #def __init__ (self, x):4 #self.val = x5 #self.left = None6 #self.right = None7 8 classsolution (object):9     defpathsum (self, Root, sum):Ten         """ One : Type Root:treenode A : Type Sum:int - : Rtype:list[list[int]] -         """ the         defdfs (Root, Currsum, valuelist): -             ifRoot.left = = None andRoot.right = =None: -                 ifCurrsum = =sum:res.append (valuelist) -             ifRoot.left: +DFS (Root.left, Currsum+root.left.val, valuelist+[Root.left.val]) -             ifRoot.right: +DFS (Root.right, currsum+root.right.val,valuelist+[Root.right.val]) A          atres = [] -         ifRoot ==none:returnRes - dfs (Root, Root.val, [Root.val]) -         returnRes

[Leetcode] (python): 113 Path Sum II

Related Article

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.