Merge pull request #1275 from printjin-gmailcom/main

[printjin-gmailcom] WEEK 03 solutions

Author: printjin-gmailcom

combination-sum/printjin-gmailcom.py

@@ -0,0 +1,15 @@
+class Solution:
+    def combinationSum(self, candidates, target):
+        output, nums = [], []
+        def dfs(start, total):
+            if total > target:
+                return
+            if total == target:
+                return output.append(nums[:])
+            for i in range(start, len(candidates)):
+                num = candidates[i]
+                nums.append(num)
+                dfs(i, total + num)
+                nums.pop()
+        dfs(0, 0)
+        return output

decode-ways/printjin-gmailcom.py

@@ -0,0 +1,13 @@
+class Solution:
+    def numDecodings(self, s):
+        if not s:
+            return 0
+        dp = [0] * (len(s) + 1)
+        dp[0] = 1 
+        dp[1] = 1 if s[0] != '0' else 0 
+        for i in range(2, len(s) + 1):
+            if '1' <= s[i - 1] <= '9':
+                dp[i] += dp[i - 1]
+            if '10' <= s[i - 2:i] <= '26':
+                dp[i] += dp[i - 2]
+        return dp[len(s)]  

maximum-subarray/printjin-gmailcom.py

@@ -0,0 +1,7 @@
+class Solution:
+    def maxSubArray(self, nums):
+        max_sum = current_sum = nums[0]
+        for num in nums[1:]:
+            current_sum = max(num, current_sum + num)
+            max_sum = max(max_sum, current_sum)
+        return max_sum

number-of-1-bits/printjin-gmailcom.py

@@ -0,0 +1,7 @@
+class Solution:
+    def hammingWeight(self, n):
+        cnt = 0
+        while n > 0:
+            cnt += n % 2
+            n //= 2
+        return cnt

valid-palindrome/printjin-gmailcom.py

@@ -0,0 +1,4 @@
+class Solution:
+    def isPalindrome(self, s):
+        cleaned = [c.lower() for c in s if c.isalnum()]
+        return cleaned == cleaned[::-1]