week02_1_2_3_solution

Author: YOOHYOJEONG

climbing-stairs/YOOHYOJEONG.py

@@ -0,0 +1,12 @@
+# https://leetcode.com/problems/climbing-stairs
+
+class Solution(object):
+    def climbStairs(self, n):
+        if n <= 2:
+            return n
+        
+        a, b = 1, 2
+        for i in range(3, n+1):
+            a, b = b, a+b
+        
+        return b

product-of-array-except-self/YOOHYOJEONG.py

@@ -0,0 +1,19 @@
+# https://leetcode.com/problems/product-of-array-except-self/
+
+class Solution(object):
+    def productExceptSelf(self, nums):
+        
+        n = len(nums)
+        output = [1] * n
+
+        left = 1
+        for i in range(n):
+            output[i] = left
+            left *= nums[i]
+
+        right = 1
+        for i in range(n-1, -1, -1):
+            output[i] *= right
+            right *= nums[i]
+
+        return output

valid-anagram/YOOHYOJEONG.py

@@ -0,0 +1,8 @@
+# https://leetcode.com/problems/valid-anagram/
+
+class Solution(object):
+    def isAnagram(self, s, t):
+        if sorted(s) == sorted(t):
+            return True
+        else:
+            return False