企业官网建设流程全解析

震天建设集团网站,在线做c 题的网站,黄页公司,贺州招聘网站建设质数筛的思想与推广其实就是一种预处理分组 避免重复计算与选择lcr156前序bfs把二叉树转成带null标记的字符串再按层序规则把字符串还原成二叉树#xff0c;还会删掉末尾多余的null标记class Codec { public:// Encodes a tree to a single string.string serialize(TreeNode*…质数筛的思想与推广其实就是一种预处理分组 避免重复计算与选择lcr156前序bfs把二叉树转成带null标记的字符串再按层序规则把字符串还原成二叉树还会删掉末尾多余的null标记class Codec {public:// Encodes a tree to a single string.string serialize(TreeNode* root){if(root nullptr) return ;string res;queueTreeNode* order;order.push(root);while (!order.empty()){int size order.size();while(size--){auto top order.front();order.pop();if(top nullptr)resnull,;else{resto_string(top-val),;order.push(top-left);order.push(top-right);}}}res.erase(res.size()-1);while (res.size()5res.substr(res.size()-5,5),null)res.erase(res.size()-5,5);return res;}// Decodes your encoded data to tree.TreeNode* deserialize(string data) {TreeNode* head new TreeNode();if(data.size() 0)return nullptr;vectorstring value;int begin 0 ,length 0;string value_part;for(int i 0;idata.size();i){if(data[i] ,){value.push_back(data.substr(begin,length));begin i1;length 0;}elselength;}value.push_back(data.substr(begin,length));head-val stoi(value[0]);queueTreeNode* tree;tree.push(head);int pos 1;while (posvalue.size()){TreeNode *p tree.front();tree.pop();if(value[pos]!null) {p-left new TreeNode(stoi(value[pos]));tree.push(p-left);}pos;if(posvalue.size()value[pos]!null) {p-right new TreeNode(stoi(value[pos]));tree.push(p-right);}pos;}return head;}};