@@ -0,0 +1,801 @@
+%22%22%22Leetcode 57. Insert Interval%0AHard%0A%0AGiven a set of non-overlapping intervals, insert a new interval into the intervals%0A(merge if necessary).%0A%0AYou may assume that the intervals were initially sorted according to their start times.%0A%0AExample 1:%0AInput: intervals = %5B%5B1,3%5D,%5B6,9%5D%5D, newInterval = %5B2,5%5D%0AOutput: %5B%5B1,5%5D,%5B6,9%5D%5D%0A%0AExample 2:%0AInput: intervals = %5B%5B1,2%5D,%5B3,5%5D,%5B6,7%5D,%5B8,10%5D,%5B12,16%5D%5D, newInterval = %5B4,8%5D%0AOutput: %5B%5B1,2%5D,%5B3,10%5D,%5B12,16%5D%5D%0AExplanation: Because the new interval %5B4,8%5D overlaps with %5B3,5%5D,%5B6,7%5D,%5B8,10%5D.%0A%22%22%22%0A%0Aclass Solution(object):%0A    def insert(self, intervals, newInterval):%0A        %22%22%22%0A        :type intervals: List%5BList%5Bint%5D%5D%0A        :type newInterval: List%5Bint%5D%0A        :rtype: List%5BList%5Bint%5D%5D%0A        %22%22%22%0A        pass%0A%0A%0Adef main():%0A    pass%0A%0A%0Aif __name__ == '__main__':%0A    main()%0A

Add lc0057_insert_interval.py