python: add some problems and unittest

Author: supercoderhawk

Python/common_utils.py

@@ -14,3 +14,8 @@ def print_linked_list(head):
             s += '->'
         node = node.next
     print(s)
+
+class Interval:
+    def __init__(self, s=0, e=0):
+        self.start = s
+        self.end = e

Python/sln_1_100/solution_11_20.py

@@ -0,0 +1,11 @@
+# -*- coding: utf-8 -*-
+
+class Solution_11_20(object):
+    def intToRoman(self, num):
+        """
+
+        :param num:
+        :return:
+        """
+        rets = ['I','V','X','L','C','D','M']
+

Python/solution_41_50.py renamed to Python/sln_1_100/solution_41_50.py

@@ -1,6 +1,25 @@
 # -*- coding: UTF-8 -*-
+from itertools import permutations
+from common_utils import Interval
 
 class Solution_51_60:
+    def solveNQueens(self, n):
+        """
+        51
+        :type n: int
+        :rtype: List[List[str]]
+        """
+        outputs = []
+        for candidate in permutations(range(0, n)):
+            left_triangle = {v - i for i, v in enumerate(candidate)}
+            right_triangle = {v + i for i, v in enumerate(candidate)}
+            if len(left_triangle) == len(right_triangle) == n:
+                output = []
+                for queen in candidate:
+                    output.append('.' * queen + 'Q' + '.' * (n - 1 - queen))
+                outputs.append(output)
+        return outputs
+
     def spiralOrder(self, matrix):
         """
         problem 54 - Spiral Matrix
@@ -41,7 +60,26 @@ def spiralOrder(self, matrix):
             curr_direction = (curr_direction + 1) % 4
 
         return res
-
+    def merge(self, intervals):
+        """
+        56
+        :type intervals: List[Interval]
+        :rtype: List[Interval]
+        """
+        intervals = sorted(intervals, key=lambda i: i.start)
+        new_intervals = []
+        last_end = -1
+        last_start = -1
+        for iterval in intervals:
+            start, end = iterval.start, iterval.end
+            if new_intervals and last_end >= start:
+                new_start = start if start < last_start else last_start
+                new_end = end if end > last_end else last_end
+                new_intervals.pop(-1)
+                start, end = new_start, new_end
+            new_intervals.append(Interval(start, end))
+            last_start, last_end = start, end
+        return new_intervals
     def lengthOfLastWord(self, s):
         """
         58

Python/sln_1_100/solution_51_60.py

@@ -0,0 +1,33 @@
+# -*- coding: utf-8 -*-
+class Solution_71_80(object):
+    def simplifyPath(self, path):
+        """
+        :type path: str
+        :rtype: str
+        """
+        if not path or path == '/':
+            return path
+
+        r_offset = 0
+        while len(path) - 1 >= r_offset and path[len(path) - 1 - r_offset] == '/':
+            r_offset += 1
+
+        if r_offset:
+            path = path[:-r_offset]
+
+        if not path:
+            return '/'
+
+        path_segments = path[1:].split('/')
+        final_path_segments = []
+
+        for segment in path_segments:
+            if segment == '..':
+                if final_path_segments:
+                    final_path_segments.pop()
+            elif segment in {'.', ''}:
+                continue
+            else:
+                final_path_segments.append(segment)
+
+        return '/' + '/'.join(final_path_segments)

Python/sln_1_100/solution_71_80.py

@@ -1,5 +1,5 @@
 from unittest import TestCase
-from solution_41_50 import Solution_41_50
+from sln_1_100.solution_41_50 import Solution_41_50
 
 
 # -*- coding: UTF-8 -*-

Python/test_solution_41_50.py renamed to Python/sln_1_100/test_solution_41_50.py

@@ -1,6 +1,6 @@
 from unittest import TestCase
 from sln_1_100.solution_51_60 import Solution_51_60
-
+from common_utils import Interval
 
 # -*- coding: UTF-8 -*-
 class TestSolution_51_60(TestCase):
@@ -12,6 +12,9 @@ def test_spiralOrder(self):
         res = [1, 2, 3, 6, 9, 8, 7, 4, 5]
         self.assertEqual(self.sln.spiralOrder(m), res)
         self.assertEqual(self.sln.spiralOrder([[1]]), [1])
+    def test_merge(self):
+        raw_span1 = [[1,3],[2,6],[8,10],[15,18]]
+        span1 = [Interval(start,end) for start,end in raw_span1]
 
     def test_lengthOfLastWord(self):
         length = self.sln.lengthOfLastWord('Hello world')

Python/sln_1_100/test_solution_51_60.py

@@ -0,0 +1,15 @@
+# -*- coding: utf-8 -*-
+from unittest import TestCase
+from sln_1_100.solution_71_80 import Solution_71_80
+
+class TestSolution_71_80(TestCase):
+    def setUp(self):
+        self.sln = Solution_71_80()
+
+    def test_simplifyPath(self):
+        ret = self.sln.simplifyPath('/a/./b/../../c/')
+        print(ret)
+        ret2 = self.sln.simplifyPath('/a/./b///../c/../././../d/..//../e/./f/./g/././//.//h///././/..///')
+        print(ret2)
+        self.assertEqual(self.sln.simplifyPath('///'),'/')
+        self.assertEqual(self.sln.simplifyPath('/...'), '/...')