2. 程式人生 > >[leetcode-406-Queue Reconstruction by Height]

[leetcode-406-Queue Reconstruction by Height]

阿新 • • 發佈：2017-05-24
pytho pos line and sin solution ont input concise

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]]

思路：

參考的別人的，下邊有鏈接，

  1. Pick out tallest group of people and sort them in a subarray (S). Since there‘s no other groups of people taller than them, therefore each guy‘s index will be just as same as his k value.
  2. For 2nd tallest group (and the rest), insert each one of them into (S) by k value. So on and so forth.

E.g.
input: [[7,0], [4,4], [7,1], [5,0], [6,1], [5,2]]
subarray after step 1: [[7,0], [7,1]]
subarray after step 2: [[7,0], [6,1], [7,1]]
...

It‘s not the most concise code, but I think it well explained the concept.

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

參考：

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

https://discuss.leetcode.com/topic/60470/6-lines-concise-c

[leetcode-406-Queue Reconstruction by Height]

相關推薦

[leetcode-406-Queue Reconstruction by Height]

pytho pos line and sin solution ont input concise Suppose you have a random list of people standing in a queue. Each person is described

[leetcode] 406.Queue Reconstruction by Height

clas 其中 發現 可能 etc index stand true eight Suppose you have a random list of people standing in a queue. Each person is described by a pair

python leetcode 406. Queue Reconstruction by Height

要儘量保證大的h在後面 所以進行如下 people = sorted(people, key=lambda people:(-people[0],people[1])) h降序 k降序 再遍歷進行插入操作，插入位置為people[i][1]能保證符合題意 舉例說明 people=[[7,0]

leetcode:(406)Queue Reconstruction by Height(java)

題目：       Suppose you have a random list of people standing in a queue. Each person is described by a pair of integers (h, k),

[Leetcode] 406. Queue Reconstruction by Height 直覺解釋

406. Queue Reconstruction by Height https://leetcode.com/problems/queue-reconstruction-by-height/ 首先，我們找到最小的 height (h, k)，這個資料對的最終位置應該是在 k +

Leetcode 406. Queue Reconstruction by Height[Medium]

原題地址 題目內容 題目分析 題目的主要意思為，給你一串陣列，讓你對其進行“排序”，每個元素由兩個值構成(a,b)，a代表這個字元的大小，b代表有多少個比他大或者等於他的數字排在他前面，這就是最後生成的陣列需要滿足的條件。 首先我們可以對陣列按照a進行從大到小的排序，如果

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 person and

[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

[LeetCode]406. Queue Reconstruction by Height

[LeetCode]406. Queue Reconstruction by Height 題目描述 思路 參考了答案解法 people： [[7,0], [4,4], [7,1], [5,0], [6,1], [5,2]] 排序後： [[7,0], [7,1]

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

406. Queue Reconstruction by Height

pre bject err list next return integer leetcode sta Suppose you have a random list of people standing in a queue. Each person is describ

406 Queue Reconstruction by Height 根據身高重建隊列

.com ems end cnblogs 輸出 rand desc 大於 ret 假設有打亂順序的一群人站成一個隊列。 每個人由一個整數對(h, k)表示，其中h是這個人的身高，k是排在這個人前面且身高大於或等於h的人數。 編寫一個算法來重建這個隊列。註意：總人數少於110

406. Queue Reconstruction by Height的C++解法

先把people按照第一項降序排列(第一項一樣的按第二項升序)。然後重新插入即可。 其中要注意的是重寫了sort的比較規則，寫在一個class內需要在函式前加static。   class Solution { public: static bool cmp(pair<

[LeetCode] 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 a

LeetCode 406: Queue Reconstruction

return [] turn list .so [0 etc class const This is SO AWESOME solution. class Solution { public int[][] reconstructQueue(int[][] peo

451.Queue Reconstruction by Height (Medium)

rand 相同 type algorithm nbsp list input ret 思路 Suppose you have a random list of people standing in a queue. Each person is described by

Leetcode406 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

LintCode：1252. 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 he

[leetcode-451-Sort Characters By Frequency]

eas log esc mos pla aaa interview with quest Given a string, sort it in decreasing order based on the frequency of characters. Example 1

[LeetCode] Implement Queue using Stacks