Leetcode-406. Queue Reconstruction by Height(python)

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]

先对列表进行排序，排序后 [[7, 0], [7, 1], [6, 1], [5, 0], [5, 2], [4, 4]] 

然后通过insert()方法进行插入，通过list[][1]的值进行插入.

class Solution(object):
    def reconstructQueue(self, people):
        """
        :type people: List[List[int]]
        :rtype: List[List[int]]
        """
        f = sorted(people, reverse=True)
        q = []
        q.append(f[0])
        for i in range(1, len(f)):
            if f[i][0] == q[i - 1][0]:
                if f[i][1] < q[i - 1][1]:
                    q.insert(len(q) - 1, f[i])
                else:
                    q.append()
            else:
                q.append(f[i])
        list = []
        l = q
        list.append(l[0])
        for i in range(1,len(l)):
            list.insert(l[i][1],l[i])
        return list
l = Solution()
fq=l.reconstructQueue([[8,0],[1,5],[2,4],[7,2],[7,1],[5,5],[5,4],[6,3],[4,3],[3,2]])
print(fq)