数据结构与算法
qq_24787423
这个作者很懒,什么都没留下…
展开
-
2020-10-05
LeetCode 671 二叉树中第二小的结点 Given a non-empty special binary tree consisting of nodes with the non-negative value, where each node in this tree has exactly two or zero sub-node. If the node has two sub-nodes, then this node’s value is the smaller value among原创 2020-10-05 09:50:17 · 81 阅读 · 0 评论 -
二叉树所有路径(非递归)
给定一个二叉树,返回所有从根节点到叶子节点的路径。 说明: 叶子节点是指没有子节点的节点。 struct Node { int value; Node* left; Node* right; }; vector<string> printRoutes(Node* root) { stack<Node*> s; s.push(root); string str = ""; vector<string> ret; while(!s.empty()) {原创 2020-10-04 18:17:42 · 430 阅读 · 2 评论 -
重塑二维矩阵
Input: nums = [[1,2], [3,4]] r = 1, c = 4 Output: [[1,2,3,4]] Explanation: The row-traversing of nums is [1,2,3,4]. The new reshaped matrix is a 1 * 4 matrix, fill it row by row by using the previous list. #include<iostream> #include<unistd.h>原创 2020-09-27 10:07:10 · 94 阅读 · 0 评论 -
合并二叉树
#include<iostream> #include<unistd.h> #include<vector> #include<stack> #include<queue> using namespace std; struct Node { int value; Node* left; Node* right; }; vector<int> layerTraversal(Node* root) { vector<i原创 2020-09-25 17:51:29 · 48 阅读 · 0 评论 -
二叉排序树BST
#include<iostream> #include<unistd.h> #include<vector> #include<stack> #include<queue> using namespace std; struct Node { Node(int input):value(input) { } int value; Node* left = nullptr; Node* right = nullptr; }; ve原创 2020-09-23 16:34:12 · 45 阅读 · 0 评论 -
二叉树非递归遍历
层序遍历 #include<iostream> #include<vector> #include<queue> using namespace std; struct Node { int value; Node* left; Node* right; }; vector<int> layerTraversal(Node* root) { vector<int> result; queue<Node*> q; q.pu原创 2020-09-23 14:23:47 · 60 阅读 · 0 评论