M阳光的专栏

链接：http://acm.hdu.edu.cn/showproblem.php?pid=1829 用二分图做的,,,,,,

链接：http://acm.hdu.edu.cn/showproblem.php?pid=1016 DFSd

DFS

链接：http://poj.org/problem?id=2386

链接: https://oj.leetcode.com/problems/convert-sorted-array-to-binary-search-tree/

链接: https://oj.leetcode.com/problems/path-sum/ shen

链接: https://oj.leetcode.com/problems/sum-root-to-leaf-numbers/ dfs..sum保存中间结果.每计算完一条路径,就更新ans /** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; *

链接：https://oj.leetcode.com/problems/letter-combinations-of-a-phone-number/递归算法:class Solution { public: vector<string> letterCombinations(string digits) { vector<string>