Update 94. 24 点游戏.md

Author: jasoncao11

94. 24 点游戏.md

@@ -12,6 +12,7 @@ class Solution:
             #递归终止条件
             if len(nums) == 1:
                 return abs(nums[0] - TARGET) < EPSILON
+            #各种情况
             for i, x in enumerate(nums):
                 for j, y in enumerate(nums):
                     if i != j:
@@ -33,9 +34,11 @@ class Solution:
                             if solve(newNums):
                                 return True
                             newNums.pop()
-            return False
         #调用递归
-        return solve(nums)
+        flag = solve(nums)
+        if flag == True:
+            return True
+        return False
 ```
 
 ```