leetcode
涛涛不绝蕾蕾于冬
https://github.com/xlniu
展开
-
中序遍历二叉树,统计遍历的每个节点的层次
代码是在中序遍历二叉树的非递归算法上修改的。class Solution {public: vector<vector<int>> inorderTraversal(TreeNode* root) { vector<vector<int>> res; //存储结果 stack<TreeNode*>...原创 2019-06-20 14:32:56 · 628 阅读 · 0 评论 -
中序遍历二叉树,将树结构转为双向链表结构
示例:中序遍历上图中的二叉树,转换后的双向链表为:4⇆6⇆8⇆10⇆12⇆14⇆16。代码:class Solution {public: TreeNode* inorderTraversal(TreeNode* root) { stack<TreeNode*> s; //p为当前遍历结点,prev为当前结点的前一个结点 ...原创 2019-06-20 15:14:43 · 608 阅读 · 0 评论 -
Find First and Last Position of Element in Sorted Array
leetcode34Given an array of integers nums sorted in ascending order, find the starting and ending position of a given target value.Your algorithm’s runtime complexity must be in the order of O(log n...原创 2019-06-24 21:29:32 · 133 阅读 · 0 评论