정규식 / 수요일 6문제 / 5주차

수요일/Kyusik/week5/문자열다루기기본.js

@@ -0,0 +1,7 @@
+function solution(s) {
+    if(s.length === 4 || s.length === 6){
+        return s.split("").every(c => !isNaN(c))
+    } else {
+        return false;
+    }
+}

수요일/Kyusik/week5/부족한금액계산하기.js

@@ -0,0 +1,9 @@
+function solution(price, money, count) {
+    let totalPrice = 0;
+
+    for(let i = 1;i <= count; i++){
+        totalPrice += price * i;
+    }
+
+    return money > totalPrice ? 0 : totalPrice-money
+}

수요일/Kyusik/week5/약수의갯수와덧셈.js

@@ -0,0 +1,22 @@
+function solution(left, right) {
+    let divisorArr = [];
+    let resultArr = [];
+    for(let j = left; j <= right; j++){
+        for(let i = 1; i <= Math.sqrt(j); i++){
+            if(j % i === 0) {
+                divisorArr.push(i);
+                divisorArr.push(j / i);
+            }
+        }
+        let divisorSet = new Set(divisorArr)
+        divisorArr = [];
+        if(divisorSet.size % 2 === 0){
+            resultArr.push(j)
+        }else{
+            resultArr.push(-j)
+        }
+        divisorSet.clear()
+    }
+    console.log(resultArr)
+    return resultArr.reduce((acc, cur) => acc + cur, 0);
+}

수요일/Kyusik/week5/직사각형별찍기.js

@@ -0,0 +1,12 @@
+process.stdin.setEncoding('utf8');
+process.stdin.on('data', data => {
+    const n = data.split(" ");
+    const garo = Number(n[0]), saero = Number(n[1]);
+    for(let i = 0; i < saero; i++){
+        let star = '';
+        for(let j = 0; j < garo; j++){
+            star = star + '*';
+        }
+        console.log(star);
+    }
+});

수요일/Kyusik/week5/최대공약수와최소공배수.js

@@ -0,0 +1,12 @@
+function solution(n, m) {
+    return [gcd(n, m), lcm(n, m)];
+}
+
+function lcm(n, m) {
+    return (n * m) / gcd(n, m);
+}
+
+function gcd(n, m){
+    if(m === 0) return n;
+    return n > m ? gcd(m, n % m) : gcd(n, m % n);
+}

수요일/Kyusik/week5/행렬의덧셈.js

@@ -0,0 +1,11 @@
+function solution(arr1, arr2) {
+    let answer = [];
+    for(let i = 0; i < arr1.length; i++){
+        let first = [];
+        for(let j = 0; j < arr1[i].length; j++){
+            first.push(arr1[i][j] + arr2[i][j]);
+        }
+        answer.push(first);
+    }
+    return answer;
+}