[hjeomdev] WEEK 02 solutions

climbing-stairs/hjeomdev.java

@@ -0,0 +1,18 @@
+class Solution {
+    List<Integer> list = new ArrayList<>();
+    public int climbStairs(int n) {
+        list.add(0);
+        list.add(1);
+        list.add(2);
+        return step(n);
+    }
+
+    public int step(int n) {
+        if (list.size() > n && list.get(n) != null) {
+            return list.get(n);
+        }
+        int result = step(n - 1) + step(n - 2);
+        list.add(result);
+        return result;
+    }
+}

valid-anagram/hjeomdev.java

@@ -0,0 +1,21 @@
+class Solution {
+    public boolean isAnagram(String s, String t) {
+        if (s.length() != t.length()) {
+            return false;
+        }
+
+        String[] sList = s.split("");
+        Arrays.sort(sList);
+        String[] tList = t.split("");
+        Arrays.sort(tList);
+
+        for (int i = 0; i < s.length(); i++) {
+            // System.out.println(sList[i] + " " + tList[i]);
+            if (!sList[i].equals(tList[i])) {
+                return false;
+            }
+        }
+
+        return true;
+    }
+}