2020年6月7日
[LeetCode] 406. Queue Reconstruction by Height
摘要： You are given an array of people, people, which are the attributes of some people in a queue (not necessarily in order). Each people[i] = [hi, ki] rep 阅读全文
posted @ 2020-06-07 02:24 CNoodle 阅读(120) 评论(0) 推荐(0)