[jiyseo] solve 2 problems

Author: jiyseo

climbing-stairs/jiyseo.py

@@ -0,0 +1,17 @@
+class Solution(object):
+    def fac(self, n) :
+        fac = 1
+        for i in range(1, n + 1) :
+            fac *= i
+        return fac
+
+    def climbStairs(self, n):
+        res = 0
+        for i in range(n // 2 + 1) :
+            if i == 0 :
+                res += 1
+            else :
+                cnt = n - i
+                res += Solution().fac(cnt)/(Solution().fac(i) * Solution().fac(cnt - i))
+        return res
+        

valid-anagram/jiyseo.py

@@ -0,0 +1,12 @@
+class Solution(object):
+    def isAnagram(self, s, t):
+        # 시간복잡도 = O(N * (N + M))
+        if len(s) != len(t) :
+            return False
+
+        for i in set(s) :
+            if s.count(i) != t.count(i) :
+                return False
+
+        return True
+