-
Notifications
You must be signed in to change notification settings - Fork 1
/
smallestStringFromLeaf.cpp
42 lines (36 loc) · 1020 Bytes
/
smallestStringFromLeaf.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
40
41
42
// * 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) {}
};
#include <vector>
#include <string>
#include <iostream>
using namespace std;
class Solution {
public:
string res = "";
void dfs(TreeNode* root,string s){
if(!root)return ;
string cur = (char)(root->val +'a')+s;
if(root->right)dfs(root->right,cur);
if(root->left)dfs(root->left,cur);
if(!root->left && !root->right){
string temp = (char)(root->val +'a')+s;
if(res.length()==0)res = temp;
if(temp<res)res=temp;
}
}
string smallestFromLeaf(TreeNode* root) {
dfs(root,res);
return res;
}
};
int main(){
Solution s;
return 0;
}