Queue Reconstruction by Height

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 person and k is the number of people in front of this person who have a height greater than or equal to h. Write an algorithm to reconstruct the queue.

Note:
The number of people is less than 1,100.

Example

Input:
[[7,0], [4,4], [7,1], [5,0], [6,1], [5,2]]

Output:
[[5,0], [7,0], [5,2], [6,1], [4,4], [7,1]]

转载于discuss ---- https://discuss.leetcode.com/topic/60394/easy-concept-with-python-c-java-solution

思路：贪心。从队列中找到最大高度的人，那么将不会存在比它更高的人，按k从低到高排，就是他们在队列的相对顺序。然后，将排好的人剔除，从剩余人的队列中，再找出最高的，直至队列为空。

输入：[[7,0], [4,4], [7,1], [5,0], [6,1], [5,2]]

第一步：[[7,0],[7,1]]

next：[[7,0],[6,1],[7,1]]

next：[[5,0][7,0][5,2],[6,1],[7,1]]

end：[[5,0][7,0][5,2],[6,1],[4,4],[7,1]]

vector
   
   
    
    
     
     > reconstructQueue(vector
     
     
      
      
       
       >& people) {
        sort(people.begin(), people.end(),[](pair
       
       
         p1, pair 
        
          p2){ return p1.first > p2.first || (p1.first == p2.first && p1.second < p2.second); }); vector 
          
          
            > sol; for (auto person : people){ sol.insert(sol.begin() + person.second, person); } return sol; } 
           
          
         
       
      
      
     
     
    
    
   
   

Note: sort的用法转自：http://www.wl566.com/biancheng/98907.html

1.声明外部比较函数

bool Less(const Student& s1, const Student& s2)
{
    return s1.name < s2.name; //从小到大排序
}
std::sort(sutVector.begin(), stuVector.end(), Less);

2. 重载类的比较运算符

bool operator<(const Student& s1, const Student& s2)
{
    return s1.name < s2.name; //从小到大排序
}
std::sort(sutVector.begin(), stuVector.end());

3. 方法3：声明比较类

struct Less
{
    bool operator()(const Student& s1, const Student& s2)
    {
        return s1.name < s2.name; //从小到大排序
    }
};

std::sort(sutVector.begin(), stuVector.end(), Less());