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 the path is 0 -> 1 -> 1 -> 0 -> 1, then this could represent 01101 in binary, which is 13.
执行用时 :4 ms, 在所有 C++ 提交中击败了98.31%的用户 内存消耗 :16.9 MB, 在所有 C++ 提交中击败了100.00%的用户