2016年10月2日
[LeetCode] 406. Queue Reconstruction by Height 根据高度重建队列
摘要： Suppose you have a random list of people standing in a queue. Each person is described by a pair of integers(h, k), where h is the height of the perso 阅读全文
posted @ 2016-10-02 23:58 Grandyang 阅读(20855) 评论(11) 推荐(1)
Fork me on GitHub