qq_42181301的博客

#include <iostream> #include <string> using namespace std; struct TreeNode { int val; TreeNode *left; TreeNode *right; }; //根据键盘输入前序序列构建二叉树 TreeNode* createTree(TreeNode* root) { char info; cin >> info; if (info == '#') root = .

1.问题类似于力扣652 2.输入层序序列化的二叉树，输出最大同构子树的大小 eg:1 2 3 4 # 5 # # # # # --> 2 1 2 2 3 3 # 3 # 4 4 # 4 4 # # # # # 5 5 # # # # # --> 5 #include <iostream> #include <unordered_map> #include <string> #include <queue> using name...

1.冒泡排序 #include <iostream> #include <vector> using namespace std; void bubbleSort(vector<int> &data) { int n = data.size(); if (n < 2) { return; } for (int i = n - 1; i > 0; i--) { for (int j = 0; j < i; j++) {

1.自上而下层序遍历输出，题目描述参见力扣102 #include <iostream> #include <vector> #include <queue> using namespace std; struct TreeNode { int val; TreeNode* left; TreeNode* right; TreeNode(): val(0),left(nullptr), right(nullptr) {} TreeNode(int data

#include <iostream> #include <vector> using namespace std; int search(vector<int>& data, int left, int right, int key) { while (left < right) { int mid = left + (right - left) / 2; if (data[mid] == key) { return mid; } .