Solved 2 problems

Author: gyeong-hyeon-kim

level-2/멀쩡한-사각형.js

@@ -0,0 +1,35 @@
+//https://github.com/codeisneverodd/programmers-coding-test
+//완벽한 정답이 아닙니다.
+//정답 1
+function solution(w, h) {
+    var answer = 1;
+    const gcd = greatestCommonDivisor(w,h)
+    answer = w * h - (h + w - gcd)
+    return answer;
+}
+
+let greatestCommonDivisor = (a, b) => {
+    while(b > 0){
+        let r = a % b;
+        a = b;
+        b = r;
+    }
+    return a;
+}
+//정답 2
+function solution(w, h) {
+    var answer = 1;
+    const gcd = greatestCommonDivisor(w,h)
+    const erasedBoxInUnit = h/gcd + w/gcd - 1
+    answer = w * h - erasedBoxInUnit * gcd
+    return answer;
+}
+
+let greatestCommonDivisor = (a, b) => {
+    while(b > 0){
+        let r = a % b;
+        a = b;
+        b = r;
+    }
+    return a;
+}

level-2/오픈채팅방.js

@@ -0,0 +1,16 @@
+//https://github.com/codeisneverodd/programmers-coding-test
+//완벽한 정답이 아닙니다.
+function solution(record) {
+    var answer = [];
+    const users = {}
+    record.map(history => {
+        const [action, id, name] = history.split(' ')
+        if(action !== 'Leave') users[id] = name
+    })
+    record.map(history => {
+        const [action, id, name] = history.split(' ')
+        if(action === 'Enter') answer.push(`${users[id]}님이 들어왔습니다.`)
+        if(action === 'Leave') answer.push(`${users[id]}님이 나갔습니다.`)
+    })
+    return answer;
+}