<commit_before>---
layout: post
title:  "LeetCode : Sum Root To Leaf Numbers"
date:   2016-11-27 23:12:13
categories: leetcode
permalink: /archivers/surrounded_regions
---
# LeetCode : Surrounded Regions
----
----

### 问题描述

----
> Given a binary tree containing digits from0-9only, each root-to-leaf path could represent a number.

> An example is the root-to-leaf path1->2->3which represents the number123.

> Find the total sum of all root-to-leaf numbers.

> For example,

>    1

>   / \

>  2   3

> The root-to-leaf path1->2represents the number12.

> The root-to-leaf path1->3represents the number13.

> Return the sum = 12 + 13 =25.

### 思路整理

----<commit_msg>update leetcode<commit_after>---
layout: post
title:  "LeetCode : Sum Root To Leaf Numbers"
date:   2016-11-27 23:12:13
categories: leetcode
permalink: /archivers/sum_root_to_leaf_numbers
---
# LeetCode : Surrounded Regions
----
----

### 问题描述

----
> Given a binary tree containing digits from0-9only, each root-to-leaf path could represent a number.

> An example is the root-to-leaf path1->2->3which represents the number123.

> Find the total sum of all root-to-leaf numbers.

> For example,

>    1

>   / \

>  2   3

> The root-to-leaf path1->2represents the number12.

> The root-to-leaf path1->3represents the number13.

> Return the sum = 12 + 13 =25.

### 思路整理

----
{'fraction_non_alphanumeric': 0.13224368499257058, 'fraction_numerical': 0.05794947994056464, 'mean_word_length': 2.93859649122807, 'pattern_counts': {'":': 0, '<': 3, '<?xml version=': 0, '>': 31, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '815567', 'n_tokens_mistral': 536, 'n_tokens_neox': 496, 'n_words': 149}