leetcode 218: The Skyline Problem
来源:互联网 发布:免费远程监控软件 编辑:程序博客网 时间:2024/06/05 08:13
The Skyline Problem
Total Accepted: 1071 Total Submissions: 6525A city's skyline is the outer contour of the silhouette formed by all the buildings in that city when viewed from a distance. Now suppose you aregiven the locations and height of all the buildings as shown on a cityscape photo (Figure A), write a program tooutput the skyline formed by these buildings collectively (Figure B).
The geometric information of each building is represented by a triplet of integers[Li, Ri, Hi]
, whereLi
and Ri
are the x coordinates of the left and right edge of the ith building, respectively, andHi
is its height. It is guaranteed that0 ≤ Li, Ri ≤ INT_MAX
,0 < Hi ≤ INT_MAX
, and Ri - Li > 0
. You may assume all buildings are perfect rectangles grounded on an absolutely flat surface at height 0.
For instance, the dimensions of all buildings in Figure A are recorded as: [ [2 9 10], [3 7 15], [5 12 12], [15 20 10], [19 24 8] ]
.
The output is a list of "key points" (red dots in Figure B) in the format of[ [x1,y1], [x2, y2], [x3, y3], ... ]
that uniquely defines a skyline.A key point is the left endpoint of a horizontal line segment. Note that the last key point, where the rightmost building ends, is merely used to mark the termination of the skyline, and always has zero height. Also, the ground in between any two adjacent buildings should be considered part of the skyline contour.
For instance, the skyline in Figure B should be represented as:[ [2 10], [3 15], [7 12], [12 0], [15 10], [20 8], [24, 0] ]
.
Notes:
- The number of buildings in any input list is guaranteed to be in the range
[0, 10000]
. - The input list is already sorted in ascending order by the left x position
Li
. - The output list must be sorted by the x position.
- There must be no consecutive horizontal lines of equal height in the output skyline. For instance,
[...[2 3], [4 5], [7 5], [11 5], [12 7]...]
is not acceptable; the three lines of height 5 should be merged into one in the final output as such:[...[2 3], [4 5], [12 7], ...]
[思路]
起床再写 : )
[CODE]
public class Solution { public List<int[]> getSkyline(int[][] buildings) { List<int[]> res = new ArrayList<int[]>(); PriorityQueue<Integer> maxHeap = new PriorityQueue<Integer>(11, new Comparator<Integer>(){ @Override public int compare(Integer a, Integer b) { return b - a; } }); List<int[]> bl = new ArrayList<int[]>(); for(int i=0; i<buildings.length; i++) { int[] b = buildings[i]; bl.add(new int[]{b[0], b[2]}); bl.add(new int[]{b[1], -b[2]}); } Collections.sort(bl, new Comparator<int[]>() { @Overridepublic int compare(int[] a, int[] b) { if(a[0]!=b[0]) return a[0] - b[0]; else return b[1] - a[1]; } }); int pre = 0, cur = 0; for(int i=0; i<bl.size(); i++) { int[] b = bl.get(i); if(b[1]>0) { maxHeap.add(b[1]); cur = maxHeap.peek(); } else { maxHeap.remove(-b[1]); cur = (maxHeap.peek()==null) ? 0 : maxHeap.peek(); } if(cur!=pre) { res.add(new int[]{b[0], cur}); pre = cur; } } return res; }}
- leetcode 218: The Skyline Problem
- Leetcode 218 The Skyline Problem
- leetcode 218: The Skyline Problem
- Leetcode #218 The Skyline Problem
- [LeetCode 218] The Skyline Problem
- leetcode - The Skyline Problem
- LeetCode - The Skyline Problem
- leetcode:the skyline problem
- The Skyline Problem -- leetcode
- Leetcode -- The Skyline Problem
- 218 .The Skyline Problem
- The Skyline Problem Leetcode Java
- [leetcode] 218.The Skyline Problem
- LeetCode 218. The Skyline Problem
- LeetCode 218. The Skyline Problem
- [LeetCode]--218. The Skyline Problem
- [LeetCode]218. The Skyline Problem
- 218. The Skyline Problem [leetcode]
- 今日总结20150603
- android常见异常总结
- mule esb exception(一)
- Volley cancel
- Linux下常用的C/C++开源Socket库
- leetcode 218: The Skyline Problem
- iOS中图片拉伸技巧
- Android网络通信的六种方式示例代码
- 关于mysql数据库在运行中出现MySQL server has gone away的问题解决
- 48.核心动画之基础动画
- pg_restore - 从一个由 pg_dump 创建的备份文件中恢复 PostgreSQL 数据库。
- 1.2. chromium源代码分析 - chromiumframe - 入口函数
- 适配 - autolayout自动布局
- Java 获取计算机参数[IPvsMAC]