qq_45947519的博客

// // Created by Oision on 2022/2/25. // // UVA839 天平 Not so Mobile // 经典递归 #include <bits/stdc++.h> using namespace std; bool solve(int &w) { int l, r, lw, rw; bool ll = true, rr = true; cin >> l >> lw >> r &g..

// // Created by Oision on 2022/2/25. // #include <bits/stdc++.h> using namespace std; #define MAX_NUM 100005 int sum[MAX_NUM]; bool build(int idx) { int num; cin >> num; if (num == -1) { return 0; } else { .

初始化及遍历： #include <bits/stdc++.h> using namespace std; typedef struct TreeNode { int data; struct TreeNode *lchild, *rchild; } TreeNode, *TNode; // 递归方式创建二叉树 // 前序遍历 void creatTree(TreeNode *&t) { int num; cin >> num;