摘要: Find the K closest points to the origin in a 2D plane, given an array containing N points.看到K神马的基本上就是min/max heap.http://stackoverflow.com/questions/2... 阅读全文
posted @ 2016-01-19 04:43 Hygeia 阅读(4290) 评论(0) 推荐(0) 编辑