[RiaOh] WEEK 02 solutions

climbing-stairs/RiaOh.js

@@ -0,0 +1,11 @@
+/**
+ * @param {number} n
+ * @return {number}
+ */
+var climbStairs = function (n) {
+  const arr = [1, 2];
+  for (let i = 2; i <= n - 1; i++) {
+    arr[i] = arr[i - 2] + arr[i - 1];
+  }
+  return arr[n - 1];
+};

product-of-array-except-self/RiaOh.js

@@ -0,0 +1,31 @@
+/**
+ * @param {number[]} nums
+ * @return {number[]}
+ */
+var productExceptSelf = function (nums) {
+  // [-1,1,0,-3,3]
+  if (!nums.includes(0)) {
+    const allNumsProduct = nums.reduce((acc, cur) => acc * cur);
+    return nums.map((num) => allNumsProduct / num);
+  } else {
+    let arr = [];
+    for (let i = 0; i < nums.length; i++) {
+      if (nums[i] !== 0) {
+        arr[i] = 0;
+      } else {
+        console.log("여기는?");
+        const newArr = [...nums];
+        newArr.splice(i, 1);
+        console.log("newArr ==>", newArr);
+        if (newArr.includes(0)) {
+          arr[i] = 0;
+        } else {
+          const product = newArr.reduce((arr, cur) => arr * cur);
+          console.log("product ==>", product);
+          arr[i] = product;
+        }
+      }
+    }
+    return arr;
+  }
+};

valid-anagram/RiaOh.js

@@ -0,0 +1,10 @@
+/**
+ * @param {string} s
+ * @param {string} t
+ * @return {boolean}
+ */
+var isAnagram = function (s, t) {
+  let resultS = [...s].sort();
+  let resultT = [...t].sort();
+  return resultS.join() === resultT.join();
+};