随笔分类 - 算法
摘要:class UF{ private: vector<int> parent; vector<int> sz; int cnt; public: UF(int n):parent(n), sz(n), cnt(n){ for(int i = 0; i < n; i++) { parent[i] = i
阅读全文
摘要:树节点定义: typedef struct TreeNode{ int val; TreeNode *left; TreeNode *right; TreeNode(int a):val(a), left(NULL), right(NULL){} }TreeNode; AVL树接口: class A
阅读全文

浙公网安备 33010602011771号