Organize lottery done.

It wasn't hard since I worked this out in Java first. Once again, I felt
Python is really well designed and efficient.

1 files changed, 24 insertions, 0 deletions

diff --git a/AlgoDesignAndTechniqueEdxPython/tests/points_segmentsTest.py b/AlgoDesignAndTechniqueEdxPython/tests/points_segmentsTest.py
new file mode 100644
index 0000000..1a0f229
--- /dev/null
+++ b/AlgoDesignAndTechniqueEdxPython/tests/points_segmentsTest.py
@@ -0,0 +1,24 @@
+'''
+Created on Dec 9, 2018
+
+@author: haidong
+'''
+import unittest
+
+from sources.points_segments import fast_count_segments
+
+class Test(unittest.TestCase):
+
+
+    def testName(self):
+        starts = [0, 7]
+        ends = [5, 10]
+        points = [1, 6, 11]
+        results = [1, 0, 0]
+        self.assertSequenceEqual(results, fast_count_segments(starts, ends, points))
+        
+
+
+if __name__ == "__main__":
+    #import sys;sys.argv = ['', 'Test.testName']
+    unittest.main()
\ No newline at end of file