Leetcode-199. 二叉树的右视图

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
    int deep[105];
    vector<int> vec;
public:
    vector<int> rightSideView(TreeNode* root) {
        init();
        dfs(root, 1);
        return vec;
    }
    void dfs(TreeNode* root, int _deep)
    {
        if (root== nullptr) return;
        
        if(! deep[_deep]) 
        {
            vec.push_back(root->val);
            deep[_deep] = 1;
        }
        
        _deep++;
        dfs(root->right, _deep);
        dfs(root->left, _deep);
    }
    void init()
    {
        vec.clear();
        for (int i = 0; i < 101; i ++)
        {
            deep[i] = 0;
        }
    }
};