Code Signal_练习题_Sort by Height

Some people are standing in a row in a park. There are trees between them which cannot be moved. Your task is to rearrange the people by their heights in a non-descending order without moving the trees. People can be very tall!

Example

For a = [-1, 150, 190, 170, -1, -1, 160, 180], the output should be
sortByHeight(a) = [-1, 150, 160, 170, -1, -1, 180, 190].

我的解答：

 def sortByHeight(a):
     j = -2
     y = 0
     li = []
     if -1 not in a:
         a = sorted(a)
     else:
         for i in a:
             if i == -1:
                 pass
             else:
                 li.append(i)
                 a[a.index(i)] = j
                 j -= 1
         li = sorted(li)
         for x in a:
             if x != -1:
                 a[a.index(x)] = li[y]
                 y += 1
     return a

感觉自己总是不按常规出牌

膜拜大佬：

 def sortByHeight(a):

     l = sorted([i for i in a if i > 0])
     for n,i in enumerate(a):
         if i == -1:
             l.insert(n,i)
     return l