Update 24Game.py

Author: DreamOfTheRedChamber

Python/Recursion/24Game.py

@@ -8,12 +8,15 @@
 class TwentyFourGame(unittest.TestCase):
 
     def judgePoint24(self, nums: List[int]) -> bool:
-        def recursion(nums: List[int]) -> bool:
-            if len(nums) == 1:
-                return True if nums[0] == 24 else False
-
-            for i, a in enumerate(nums):
-                for j, b in enumerate(nums):
+        def recursion(numArray: List[int]) -> bool:
+            if len(numArray) == 1:
+                # error case 1
+                return True if (abs(numArray[0]-24.0) < 1e-6) else False
+
+            for i, a in enumerate(numArray):
+                for j, b in enumerate(numArray):
+                    if i == j:
+                        continue
                     possibleComb = [a+b, a*b, abs(a-b)]
                     if a != 0:
                         possibleComb.append(b/a)
@@ -22,21 +25,28 @@ def recursion(nums: List[int]) -> bool:
 
                     for newNum in possibleComb:
                         newNums = []
-                        for k in range(len(nums)):
+                        for k in range(len(numArray)):
                             if k != i and k != j:
-                                newNums.append(nums[k])
+                                newNums.append(numArray[k])
                         newNums.append(newNum)
 
+                        # print("current recursioin")
+                        # print(newNum)
+                        # print(newNums)
                         if recursion(newNums):
                             return True
 
             return False
 
         return recursion(nums)
 
+    @unittest.skip
     def test_Leetcode(self):
         self.assertTrue(self.judgePoint24([4,1,8,7]))
-        # self.assertFalse(self.judgePoint24([1,2,1,2]))
+        self.assertFalse(self.judgePoint24([1,2,1,2]))
+
+    def test_WrongAnswer(self):
+        self.assertTrue(self.judgePoint24([3,3,8,8]))
 
 if __name__ == '__main__':
     unittest.main()