题解 | 数据流中的中位数-解法1-插入排序

# -*- coding:utf-8 -*-
class Solution:
    arr=[]
    def Insert(self, num):
        # write code here
        if not  self.arr:
            self.arr.append(num)
        else:
            n=len(self.arr)
            index=0
            for i in   range(n):
                if self.arr[i]<=num :
                    index+=1
                    continue
            left=self.arr[:index]
            right=self.arr[index:]
            left.append(num )

            self.arr=left+right

    def GetMedian(self):
        # write code here
        #print(self.arr)
        n =len(self.arr)
        if n%2==0:
            mid =n//2
            #print(mid,self.arr)
            return  (self.arr[mid-1] +self.arr[mid])/2.0
        else:
            mid =n//2
            return self.arr[mid]