![](https://img-blog.csdnimg.cn/20201014180756780.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
递归
文章平均质量分 70
sscssz
这个作者很懒,什么都没留下…
展开
-
【leetcode题解】【再做一遍】【47】【M】241. Different Ways to Add Parentheses
Given a string of numbers and operators, return all possible results from computing all the different possible ways to group numbers and operators. The valid operators are +,- and *. Example 1 Input原创 2015-12-24 01:46:19 · 424 阅读 · 0 评论 -
326. Power of Three【E】【81】
Given an integer, write a function to determine if it is a power of three. Follow up: Could you do it without using any loop / recursion? Credits: Special thanks to @dietpepsi for adding this原创 2016-02-14 15:35:52 · 420 阅读 · 0 评论 -
【LeetCode】508. Most Frequent Subtree Sum【M】【40】
Given the root of a tree, you are asked to find the most frequent subtree sum. The subtree sum of a node is defined as the sum of all the node values formed by the subtree rooted at that node (includi原创 2017-02-22 13:34:02 · 547 阅读 · 0 评论 -
【LeetCode】504. Base 7【E】【94】
Given an integer, return its base 7 string representation. Example 1: Input: 100 Output: "202" Example 2: Input: -7 Output: "-10" Note: The input will be in range of [-1e7, 1e原创 2017-02-27 11:06:09 · 465 阅读 · 0 评论