Leetcode-Question-433: Minimum Genetic Mutation

Orignal Link:

https://leetcode.com/problems/minimum-genetic-mutation/

Solutions:

Similar to LC 127: Word Ladder

Approach #1:

Approach #2:

 

Leetcode-Question-129: Sum Root to Leaf Numbers

原文链接:

https://leetcode.com/problems/sum-root-to-leaf-numbers/

题目描述:

Sum Root to Leaf Numbers
Difficulty: Medium

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

An example is the root-to-leaf path 1->2->3 which represents the number 123.

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

For example,

The root-to-leaf path 1->2 represents the number 12.
The root-to-leaf path 1->3 represents the number 13.

Return the sum = 12 + 13 = 25.

解答:

Updated: 2017.09.30