面试题
YAIMZA
这个作者很懒,什么都没留下…
展开
-
【leetcode】Construct Binary Tree from Inorder and Postorder Traversal----C++实现
class Solution {public: TreeNode *createTree(vector<int> &inorder,int InBegin,int InEnd, vector<int> &postorder,int PostBegin,int PostEnd){ if( InBegin原创 2018-08-19 17:13:25 · 211 阅读 · 0 评论 -
【LeetNode】permutations & permutations-ii( 递归法实现 和STL中的next_permutation函数实现)
next_permutaion和prev_permutationSTL中迭代器范围内的排列算法,next_permutaion和prev_permutation即是。头文件:#include <algorithm>函数原型:bool next_permutation(iterator start, iterator end);next_permutation...原创 2018-07-11 22:30:32 · 244 阅读 · 0 评论