Apply suggestion from @DaleSeo

Co-authored-by: Dale Seo <5466341+DaleSeo@users.noreply.github.com>

Author: doh6077

house-robber/doh6077.py

@@ -12,9 +12,9 @@ def rob(self, nums: List[int]) -> int:
 
         n = len(nums)
 
-        if n ==1:
+        if n == 1:
             return nums[0]
-        if n ==2:
+        if n == 2:
             return max(nums[0], nums[1])
         memo = {0:nums[0], 1: max(nums[0], nums[1])}
         def helper(i):