fix(codes/cpp/include/TreeNode.hpp): Fix 'vecToTree' function
This commit is contained in:
parent
acfdc713ba
commit
84825a22d9
@ -24,24 +24,27 @@ struct TreeNode {
|
||||
* @return TreeNode*
|
||||
*/
|
||||
TreeNode *vecToTree(vector<int> list) {
|
||||
TreeNode *root = new TreeNode(list[0]);
|
||||
if (list.empty()) {
|
||||
return nullptr;
|
||||
}
|
||||
|
||||
auto *root = new TreeNode(list[0]);
|
||||
queue<TreeNode *> que;
|
||||
que.emplace(root);
|
||||
int i = 1;
|
||||
while(!que.empty()) {
|
||||
TreeNode *node = que.front();
|
||||
size_t n = list.size(), index = 1;
|
||||
while (index < n) {
|
||||
auto node = que.front();
|
||||
que.pop();
|
||||
if(list[i] != INT_MAX) {
|
||||
node->left = new TreeNode(list[i]);
|
||||
|
||||
if (index < n) {
|
||||
node->left = new TreeNode(list[index++]);
|
||||
que.emplace(node->left);
|
||||
}
|
||||
i++;
|
||||
if(list[i] != INT_MAX) {
|
||||
node->right = new TreeNode(list[i]);
|
||||
if (index < n) {
|
||||
node->right = new TreeNode(list[index++]);
|
||||
que.emplace(node->right);
|
||||
}
|
||||
i++;
|
||||
}
|
||||
|
||||
return root;
|
||||
}
|
||||
|
||||
|
Loading…
Reference in New Issue
Block a user