Solved 3 problems

Author: gyeong-hyeon-kim

level-2/문자열-압축.js

@@ -0,0 +1,24 @@
+//https://github.com/codeisneverodd/programmers-coding-test
+//완벽한 정답이 아닙니다.
+function solution(s) {
+    var answer = 0;
+    let lengthArr = []
+    for(let i=1; i<=s.length; i++) lengthArr.push(compressedString(s, i).length)
+    answer = Math.min(...lengthArr)
+    return answer;
+}
+function compressedString(str, unitNum){
+    let count = 1
+    let result = ['']
+    for(let repeat=0; repeat<=str.length/unitNum; repeat++) {
+        const slicedGroup = str.slice(unitNum * repeat, unitNum * repeat+ unitNum)
+        if (result[result.length - 1] === slicedGroup) {
+            count++
+        } else {
+            if(count > 1) result[result.length - 1] = count + result[result.length - 1]
+            result.push(slicedGroup)
+            count = 1
+        }
+    }
+    return result.join('')
+}

level-2/영어-끝말잇기.js

@@ -0,0 +1,12 @@
+//https://github.com/codeisneverodd/programmers-coding-test
+//완벽한 정답이 아닙니다.
+function solution(n, words) {
+    var answer = [];
+    let turn = 1
+    for(let i=1; i<words.length; i++){
+        let pass = (words[i][0] === words[i-1][words[i-1].length-1]) && !(words.slice(0, i).includes(words[i]))
+        if(i % n === 0) turn++
+        if(!pass) return [i % n + 1, turn]
+    }
+    return [0,0];
+}

level-2/행렬-테두리-회전하기.js

@@ -0,0 +1,26 @@
+//https://github.com/codeisneverodd/programmers-coding-test
+//완벽한 정답이 아닙니다.
+function solution(rows, columns, queries) {
+    var answer = [];
+    let matrix = new Array(rows)
+    for(let i=0; i<rows; i++) matrix[i] = new Array(columns)
+    for(let i=0; i<rows; i++) for(let j=0; j<columns; j++) matrix[i][j] = i * columns + j + 1
+    for(const query of queries){
+        let order = []
+        const [row1,col1,row2,col2] = [query[0]-1, query[1]-1,query[2]-1,query[3]-1]
+        //fill order (row1->row2, col1->col2, row2->row2, col2->col1)
+        for(let i=row1; i<=row2; i++) order.push(matrix[i][col1])
+        for(let i=col1+1; i<=col2; i++) order.push(matrix[row2][i])
+        for(let i=row2-1; i>=row1; i--) order.push(matrix[i][col2])
+        for(let i=col2-1; i>col1; i--) order.push(matrix[row1][i])
+        //rotate clockwise
+        order.push(order.shift())
+        answer.push(Math.min(...order))
+        //change value in matrix
+        for(let i=row1; i<=row2; i++) matrix[i][col1] = order.shift()
+        for(let i=col1+1; i<=col2; i++) matrix[row2][i] = order.shift()
+        for(let i=row2-1; i>=row1; i--) matrix[i][col2] = order.shift()
+        for(let i=col2-1; i>col1; i--) matrix[row1][i] = order.shift()
+    }
+    return answer;
+}