Solved 2 problems

Author: gyeong-hyeon-kim

level-2/기능개발.js

@@ -0,0 +1,40 @@
+//https://github.com/codeisneverodd/programmers-coding-test
+//완벽한 정답이 아닙니다.
+//정답 1 - 시간 복잡도 감소
+function solution(progresses, speeds) {
+    var answer = [];
+    const remainDays = progresses.map((prog, index)=> Math.ceil((100-prog)/speeds[index]))
+    console.log(remainDays)
+    let maxDay = remainDays[0]
+    answer.push(0)
+    for(let i=0; i<remainDays.length; i++){
+        if(remainDays[i] <= maxDay){
+            answer[answer.length-1] += 1
+        }else{
+            answer.push(1)
+            maxDay = remainDays[i]
+        }
+    }
+    return answer;
+}
+
+//정답 2
+function solution(progresses, speeds) {
+    var answer = [];
+    while(progresses.length > 0){
+        let done = 0
+        progresses = progresses.map((prog, index)=> prog + speeds[index])
+        const length = progresses.length
+        for(let i=0; i<length; i++){
+            if(progresses[0] >= 100) {
+                progresses.shift()
+                speeds.shift()
+                done += 1
+            }else{
+                break
+            }
+        }
+        if(done > 0) answer.push(done)
+    }
+    return answer;
+}

level-2/프린터.js

@@ -0,0 +1,43 @@
+//https://github.com/codeisneverodd/programmers-coding-test
+//완벽한 정답이 아닙니다.
+//정답 1
+function solution(priorities, location) {
+    var answer = 0;
+    let documents = priorities.map((priority, index)=> ({location: index, priority: priority}))
+    let locationPrinted = false
+    while(!locationPrinted){
+        const shifted = documents.shift()
+        let printAvailable = true
+        if(documents.some((document)=> shifted.priority < document.priority)) printAvailable = false
+        if(printAvailable){
+            answer += 1
+            if(shifted.location === location) locationPrinted = true
+        }else{
+            documents.push(shifted)
+        }
+    }
+    return answer;
+}
+//정답 2
+function solution(priorities, location) {
+    var answer = 0;
+    let documents = priorities.map((priority, documentLocation)=> [documentLocation,priority])
+    let locationPrinted = false
+    while(!locationPrinted){
+        const shifted = documents.shift()
+        let printAvailable = true
+        for(let i=0; i<documents.length; i++){
+            if(shifted[1] < documents[i][1]){
+                printAvailable = false
+                break
+            }
+        }
+        if(printAvailable){
+            answer += 1
+            if(shifted[0] === location) locationPrinted = true
+        }else{
+            documents.push(shifted)
+        }
+    }
+    return answer;
+}