![](https://img-blog.csdnimg.cn/20201014180756916.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
leetcode
qq_33666011
这个作者很懒,什么都没留下…
展开
-
leetcode 101 对称二叉树
错误代码:class Solution {public: vector<int> xian(TreeNode* root,vector<int> a) { if(root->left!=NULL) a=xian(root->left,a); if(root->left==NUL...原创 2019-02-16 16:31:42 · 88 阅读 · 0 评论 -
leetcode 501. 二叉搜索树中的众数
想错了又错误的:class Solution {public: vector<int> findMode(TreeNode* root) { vector<int> jj; if(root==NULL) return jj; jj=find(root); if(...转载 2019-02-21 01:16:33 · 579 阅读 · 0 评论 -
堆 与 make_heap(), pop_heap(), push_heap() 与 priority_queue
(转载自很多博客)https://www.cnblogs.com/chenweichu/articles/5710567.htmlhttps://blog.csdn.net/zsc2014030403015/article/details/45872737https://www.jianshu.com/p/d174f1862601?utm_campaign=haruki&utm...原创 2019-06-13 15:45:50 · 570 阅读 · 0 评论