leetcode 日经贴，Cpp code -The Skyline Problem

最新推荐文章于 2020-02-23 23:20:29 发布

bachelorchen

最新推荐文章于 2020-02-23 23:20:29 发布

阅读量471

点赞数

分类专栏：算法 Cpp leetcode

本文链接：https://blog.csdn.net/bachelorchen/article/details/46005999

版权

算法同时被 3 个专栏收录

183 篇文章 0 订阅

订阅专栏

leetcode

173 篇文章 0 订阅

订阅专栏

Cpp

152 篇文章 0 订阅

订阅专栏

The Skyline Problem

class Solution {
public:
    vector<pair<int, int>> getSkyline(vector<vector<int>>& buildings) {
        vector<pair<int, int> > vertical_lines;
        for (int i = 0; i < buildings.size(); ++i) {
            vector<int> &building = buildings[i];
            vertical_lines.push_back(make_pair(building[0], -building[2]));
            vertical_lines.push_back(make_pair(building[1], building[2]));
        }
        sort(vertical_lines.begin(), vertical_lines.end());
        multiset<int> mset;
        vector<pair<int, int> > olist;
        int lasty = 0;
        for (int i = 0; i < vertical_lines.size(); ++i) {
            int x = vertical_lines[i].first, y = vertical_lines[i].second;
            if (y < 0) {
                mset.insert(-y);
            } else {
                multiset<int>::iterator itr = mset.find(y);
                mset.erase(itr);
            }
            int currenty = 0;
            if (!mset.empty()) {
                currenty = *mset.rbegin();
            }
            if (currenty != lasty) {
                olist.push_back(make_pair(x, currenty));
                lasty = currenty;
            }
        }
        return olist;
    }
};