[LeetCode] 406. Queue Reconstruction by Height

阿新 • • 發佈：2018-12-16

題目

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

題目大意

(h, k) 描述，h 表示身高，k 表示排在前面的有 k 個學生的身高比他高或者和他一樣高。

思路

h降序、k 值升序，然後按排好序的順序插入佇列的第 k 個位置中。

class Solution {
    public int[][] reconstructQueue(int[ 
][] people) {
        if(people == null || people.length == 0)
            return people;
        Arrays.sort(people, new Comparator<int[]>() {
            @Override
            public int compare(int[] o1, int[] o2) {
                return o2[0]-o1[0]==0?o1[1]-o2[1]:o2[0]-o1[0];
            }
        } 
);
        List<int[]> integerLst = new LinkedList<>();

        for(int i = 0;i<people.length;i++){
            integerLst.add(people[i][1],people[i]);
        }
        return  integerLst.toArray(new int[people.length][]);
    }
}

[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] 406. Queue Reconstruction by Height

題目

題目大意

思路

相關推薦