摘要：
Greedy using priority_queue and hashmap. The basic idea is to have k buckets - and we fill it greedily. And I agree that the code below can be cleaner 阅读全文
posted @ 2016-06-15 06:49
Tonix
阅读(216)
评论(0)
推荐(0)
摘要：
First you find the Y, and then do a pairing game - hashtable is good. class Solution { public: bool isReflected(vector<pair<int, int>>& points) { int 阅读全文
posted @ 2016-06-15 05:40
Tonix
阅读(225)
评论(0)
推荐(0)
浙公网安备 33010602011771号