i c } m l p a o s r s f } t u I n F n c o s v f } r u e s a o e n r o r r t d t r u a S t n i v w } r t o ( u a h n i r _ m i r i o t s n l n n S n j e l n n j u o : = 0 e u u m l . = j t m m - s u [ n . - s s = t I < i 1 t [ [ i n n > e j j 1 o t u = m ] - n ] m 0 p 1 ) s = ] { . & = c & n = o n u u n u m t [ n u m s e I t m s [ m n s [ j p t { [ j - ] j ] 1 ] ] { < n u m s [ j - 1 ] { 算法思想：每一步将一个待排序的记录，插入到前面已经排好序的有序序列中去，直到插完所有元素为止。 github地址：https://github.com/cubegao/LeetCode