LeetCode 129 Sum Root to Leaf Numbers DFS

阿新 • • 發佈：2022-05-16

You are given the root of a binary tree containing digits from 0 to 9 only.

Each root-to-leaf path in the tree represents a number.

For example, the root-to-leaf path 1 -> 2 -> 3 represents the number 123.
Return the total sum of all root-to-leaf numbers. Test cases are generated so that the answer will fit in a 32-bit integer.

A leaf node is a node with no children.

Solution

還是利用 \(DFS\)：用另一個引數 \(cur\) 表示當前的值，對於 \(cur\) 的更新：

\[cur = 10\cdot cur+root.val \]

如果到達葉子節點，則直接返回 \(cur\). 最後對左右子樹分別遞迴即可：

\[\text{dfs}(root.right,cur)+\text{dfs}(root.left,cur) \]

點選檢視程式碼

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
private:
    
    int dfs(TreeNode* root, int ans){
        if(!root) return 0;
        ans = ans*10 + root->val;
        if(!root->left && !root->right)return ans;
        return dfs(root->left, ans)+dfs(root->right,ans);
    }
public:
    int sumNumbers(TreeNode* root) {
        if(root==NULL) return 0;
        return dfs(root, 0);
    }
};

LeetCode 129 Sum Root to Leaf Numbers DFS

You are given the root of a binary tree containing digits from 0 to 9 only. Each root-to-leaf path in the tree represents a number.

leetcode 22：sum-root-to-leaf-numbers

題目描述給定一個僅包含數字0−9\\ 0-90−9 的二叉樹，每一條從根節點到葉子節點的路徑都可以用一個數字表示。例如根節點到葉子節點的一條路徑是1→2→31\\to 2\\to 31→2→3,那麼這

1022. Sum of Root To Leaf Binary Numbers (E)

Sum of Root To Leaf Binary Numbers (E) 題目 Given a binary tree, each node has value 0 or 1. Each root-to-leaf path represents a binary number starting with the most significant bit. For example, if t

1022. Sum of Root To Leaf Binary Numbers - Easy

Given a binary tree, each node has value0or1. Each root-to-leaf path represents a binary number starting with the most significant bit. For example, if the path is0 -> 1 -> 1 -> 0 -> 1, th

Leetcode 129 求根到葉子節點數字之和 DFS優化

　　DFS 解法，通過回溯一個 StringBuilder 記錄下所有路徑代表的數字並求和： StringBuilder sb = new StringBuilder();

LeetCode #985. Sum of Even Numbers After Queries

題目 985. Sum of Even Numbers After Queries 解題方法遍歷陣列A求得所有偶數和evensum，然後遍歷queries陣列更新陣列A、偶數和evensum和返回值rat，這裡有一個巧妙的方法，可以先從evensum中減去當前即將被更改的

【刷題-LeetCode】201 Bitwise AND of Numbers Range

Bitwise AND of Numbers Range Given a range [m, n] where 0 <= m <= n <= 2147483647, return the bitwise AND of all numbers in this range, inclusive.

AcWing 129 火車進棧(模擬，dfs)

題目連結解題思路火車進棧一共有兩種狀態，一種是後面的火車車廂進棧，一種是前面的火車出棧。可以發現，如果後面的車廂進棧了，因為先進先出，而他的編號較大，那麼他出棧的形成的序列的字典序就一定比先讓棧

[LeetCode] 1103. Distribute Candies to People

We distribute somenumber ofcandies, to a row ofn =num_peoplepeople in the following way: We then give 1 candy to the first person, 2 candies to the second person, and so on until we givencandies to th

[LeetCode] 955. Delete Columns to Make Sorted II 刪除列使其有序之二

We are given an array A of N lowercase letter strings, all of the same length. Now, we may choose any set of deletion indices, and for each string, we delete all the characters in those indices.

[LeetCode] 1551. Minimum Operations to Make Array Equal

You have an arrayarrof lengthnwherearr[i] = (2 * i) + 1for all valid values ofi(i.e.0 <= i < n).

Leetcode——129. 求根到葉子節點數字之和（遞迴）

@目錄129. 求根到葉子節點數字之和題目**思想**程式碼** 129. 求根到葉子節點數字之和

[LeetCode] 421. Maximum XOR of Two Numbers in an Array

Given an integer arraynums, returnthe maximum result ofnums[i] XOR nums[j], where0 ≤ i ≤ j < n.

[LeetCode] 714. Best Time to Buy and Sell Stock with Transaction Fee

Your are given an array of integersprices, for which thei-th element is the price of a given stock on dayi; and a non-negative integerfeerepresenting a transaction fee.

[LeetCode] 538. Convert BST to Greater Tree

Given a Binary Search Tree (BST), convert it to a Greater Tree such that every key of the original BST is changed to the original key plus sum of all keys greater than the original key in BST.