-
Notifications
You must be signed in to change notification settings - Fork 2
/
536.cpp
39 lines (37 loc) · 1.14 KB
/
536.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
TreeNode* dfs(string& s, int& index) {
if (index >= s.size() || s[index] == ')') return nullptr;
int start = index;
while (index + 1 < s.size() && s[index + 1] != '(' && s[index + 1] != ')') index++;
string temp = s.substr(start, index - start + 1);
TreeNode* node = new TreeNode(stoi(temp));
index++;
if (index < s.size() && s[index] == '(') {
index++;
node->left = dfs(s, index);
index++;
}
if (index < s.size() && s[index] == '(') {
index++;
node->right = dfs(s, index);
index++;
}
return node;
}
TreeNode* str2tree(string s) {
int index = 0;
return dfs(s, index);
}
};