[Leetcode] Queue Reconstruction by Height 解题思路
Problem: 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 person and k is the number of people in front
原创
2018-05-08 14:31:29 ·
349 阅读 ·
0 评论