refactor

Author: DreamOfTheRedChamber

Python/PriorityQueue/TaskScheduler.py

@@ -0,0 +1,60 @@
+# Definition for a binary tree node.
+import collections
+import unittest
+
+# Non-threadsafe imports
+from collections import deque
+import heapq
+
+# Threadsafe imports
+from typing import List
+
+try:
+    # Python2
+    import queue
+except ImportError:
+    # Python3
+    import Queue as queue
+
+class TaskScheduler(unittest.TestCase):
+
+    def leastInterval(self, tasks: List[str], n: int) -> int:
+        if n == 0:
+            return len(tasks)
+
+        taskCounter = collections.Counter(tasks)
+        pq = []
+        for task, count in taskCounter.items():
+            heapq.heappush(pq, (-count, task))
+
+        result = 0
+
+        while pq:
+            currSlot, tempList = 0, []
+            while currSlot != n + 1 and pq:
+                pqHead = heapq.heappop(pq)
+                if pqHead[0] + 1 < 0:
+                    tempList.append((pqHead[0] + 1, pqHead[1]))
+                currSlot += 1
+
+            if not tempList:
+                result += currSlot
+            else:
+                result += n + 1
+
+            for entry in tempList:
+                heapq.heappush(pq, entry)
+
+        return result
+
+    def test_normalCase(self):
+        tasks = ["A", "A", "A", "B", "B", "B"]
+        n = 2
+        print(self.leastInterval(tasks, 2))
+
+    def test_wrongCase(self):
+        tasks = ["A", "A", "A", "A", "A", "A", "B", "C", "D", "E", "F", "G"]
+        print(self.leastInterval(tasks, 2))
+
+if __name__ == '__main__':
+    unittest.main()

Python/TestDataStructureDict.py

@@ -6,6 +6,7 @@
 
 class TestDataStructureDict(unittest.TestCase):
 
+
     @unittest.skip
     def test_CreateDictionary(self):
         # default dictionary for string => string mapping
@@ -75,7 +76,12 @@ def test_DeleteElement(self):
         print(dictionary)
 
     def test_NestedDefaultDict(self):
-        myDict = defaultdict(lambda: defaultdict(dict))
+        # nestedDict = defaultdict(lambda: defaultdict(dict))
+
+        nestedDict = defaultdict(defaultdict)
+        nestedDict[0][1] = 2
+        print(nestedDict[0][1])
+
 
 if __name__ == '__main__':
     unittest.main()

Python/TestDataStructurePriorityQueue.py

@@ -27,6 +27,7 @@ def test_PriorityQueue_NonThreadSafe(self):
         print(heapq.heappop(li))
         print(heapq.heappop(li))
 
+    @unittest.skip
     def test_PeekHeapTop(self):
         pq = []
         heapq.heappush(pq, 3)
@@ -40,7 +41,9 @@ def test_PriorityQueue_Tuple(self):
         heapq.heappush(pq, (3, 25))
         heapq.heappush(pq, (20, 3))
         heapq.heappush(pq, (5, 5))
-
+        print(heapq.heappop(pq))
+        print(heapq.heappop(pq))
+        print(heapq.heappop(pq))
 
 if __name__ == '__main__':
-    unittest.main(
+    unittest.main()

Python/TestDataStructureString.py

@@ -22,12 +22,14 @@ def test_ConcatenateString(self):
         result = " ".join(str1)
         print(result)
 
-    @unittest.skip
     def test_SplitString(self):
         s = " this    is   my string"
         result1 = s.split()
         result2 = s.split(' ')
 
+        result3 = "hello".split(' ')
+        print(result3)
+
     @unittest.skip
     def test_Convert(self):
         # convert int to str