Leetcode-987 Vertical Order Traversal of a Binary Tree(二叉树的垂序遍历)

水过去了（发出了混子的声音

#define pb push_back
class Solution
{
    public:
        vector<vector<int> > verticalTraversal(TreeNode* root)
        {
            
            vector<vector<int>> rnt;
            if(!root)
                return rnt;
            
            vector<vector<vector<int>>> v(1000,vector<vector<int>>(1000));
            queue<pair<pair<int,int>,TreeNode*>> q;
            q.push({{0,501},root});
            
            while (!q.empty())
            {
                auto a = q.front();
                q.pop();
                v[a.first.first][a.first.second].pb(a.second->val);
                if (a.second->left)
                    q.push({{a.first.first+1,a.first.second-1}, a.second->left});
                if (a.second->right)
                    q.push({{a.first.first+1,a.first.second+1}, a.second->right});
            }
            
            for(int j = 0;j < 1000;j ++)
            {
                vector<int> vTmp;
                for(int i = 0;i < 1000;i ++)
                {
                    if(!v[i][j].empty())
                    {
                        sort(v[i][j].begin(),v[i][j].end());
                        for(int k = 0;k < v[i][j].size();k ++)
                        {
                            vTmp.pb(v[i][j][k]);
                        }
                    }
                }
                if(!vTmp.empty())
                rnt.pb(vTmp);
            }
            return rnt;
        }
};