首页 » 编程之美 » 正文

[leetcode_107]Binary Tree Level Order Traversal II

二叉树从下至上的输出层
附上代码:

class Solution {
public:
    vector<vector<int> > levelOrderBottom(TreeNode *root) {
        // IMPORTANT: Please reset any member data you declared, as
        // the same Solution instance will be reused for each test case.
        vector<vector<int>> result;
        result.clear();
        TreeNode **seq = new TreeNode *[1000];
        TreeNode **rseq = new TreeNode *[1000];
        int index = 0;
        seq[index++] = root;
        while(true)
        {
            int top = index;
            index = 0;
            vector<int> tmp;
            tmp.clear();
            for(int i = 0 ;i< top;i++)
            {
                if(seq[i] != NULL)
                {
                    tmp.push_back(seq[i]->val);
                    if (seq[i]->left != NULL)
                    {
                        rseq[index++] = seq[i]->left;
                    }
                    if (seq[i]->right != NULL)
                    {
                        rseq[index++] = seq[i]->right;
                    }<br />
                }
            }
            if(tmp.size() &gt; 0)
                result.push_back(tmp);
            if(index == 0)
                break;
            for(int i = 0;i &lt; index;i++)
            {
                seq[i] = rseq[i];
            }
        }
        vector&lt;vector&lt;int&gt;&gt; ans;
        ans.clear();
        for(int i = result.size() - 1;i &gt;= 0;i--)
        {
            ans.push_back(result[i]);
        }
        return ans;
    }
};

发表评论