Leetcode 56

Python Solution

Author: kyle8998

README.md

@@ -33,6 +33,7 @@ Personal Practice Set - Doing One a Day (sometimes) in a Variety of Languages!!
 | 36 | Medium     | [Valid Sudoku](leetcode/36-Medium-Valid-Sudoku/problem.md)                                   | [Python](leetcode/36-Medium-Valid-Sudoku/answer.py)              |
 | 53 | Easy       | [Maximum Subarray](leetcode/53-Easy-Maximum-Subarray/problem.md)                             | [Java](leetcode/53-Easy-Maximum-Subarray/answer.java)            |
 | 54 | Medium     | [Spiral Matrix](leetcode/54-Medium-Spiral-Matrix/problem.md)                                 | [Python](leetcode/54-Medium-Spiral-Matrix/answer.py)             |
+| 56 | Medium     | [Merge Intervals](leetcode/56-Medium-Merge-Intervals/problem.md)                              | [Python](leetcode/56-Medium-Merge-Intervals/answer.py)          |
 | 58 | Easy       | [Length of Last Word](leetcode/58-Easy-Length-Of-Last-Word/problem.md)                       | [Python](leetcode/58-Easy-Length-Of-Last-Word/answer.py)         |
 | 66 | Easy       | [Plus One](leetcode/66-Easy-Plus-One/problem.md)                                             | [Python](leetcode/66-Easy-Plus-One/answer.py)                    |
 | 69 | Easy       | [Sqrt()](leetcode/69-Easy-Sqrt/problem.md)                                                   | [Python](leetcode/69-Easy-Sqrt/answer.py)                        |

leetcode/56-Medium-Merge-Intervals/answer.py

@@ -0,0 +1,33 @@
+#!/usr/bin/python
+
+#------------------------------------------------------------------------------
+
+# Definition for an interval.
+# class Interval(object):
+#     def __init__(self, s=0, e=0):
+#         self.start = s
+#         self.end = e
+
+class Solution(object):
+    def merge(self, intervals):
+        """
+        :type intervals: List[Interval]
+        :rtype: List[Interval]
+        """
+        result = []
+        intervals.sort(key=lambda x: x.start)
+        
+        for i in intervals:
+            # If list is empty or does not overlap
+            if not result or result[-1].end < i.start:
+                result.append(i)
+                
+            # If there is overlap
+            else:
+                # Change the end of the interval to the higher value
+                result[-1].end = max(result[-1].end, i.end)
+                
+        return result
+
+#------------------------------------------------------------------------------
+#Testing

leetcode/56-Medium-Merge-Intervals/problem.md

@@ -0,0 +1,22 @@
+# Problem 56: Merge Intervals
+
+
+#### Difficulty: Medium
+
+#### Problem
+
+Given a collection of intervals, merge all overlapping intervals.
+
+#### Example
+
+Given the matrix
+
+<pre>
+
+Given [1,3],[2,6],[8,10],[15,18],
+
+return [1,6],[8,10],[15,18].
+
+</pre>
+
+Return ```[1,2,3,6,9,8,7,4,5]```