[rlawjd10] WEEK 02 solutions

climbing-stairs/rlawjd10.cpp

@@ -0,0 +1,21 @@
+// 피보나치 수열
+class Solution {
+public:
+    int climbStairs(int n) {
+
+       int prev1 = 1;
+       int prev2 = 1;
+
+       if (n == 1) return prev1;
+
+       for (int i = 2; i <= n; i++) {
+        int current = prev1 + prev2;
+        prev2 = prev1;
+        prev1 = current;
+       }
+
+       return prev1;
+    }
+};
+
+

valid-anagram/rlawjd10.cpp

@@ -0,0 +1,16 @@
+// 모든 철자가 있는지 확인
+class Solution {
+public:
+    bool isAnagram(string s, string t) {
+        // 1. 문자열 정렬
+        sort(s.begin(), s.end());
+        sort(t.begin(), t.end());
+
+        // 2. 비교
+        if (s.compare(t) == 0)
+            return 1;
+
+        return 0;
+    }
+};
+