[2022.04.23] 프로그래머스 풀이 추가

level-1/K번째수.js

@@ -45,3 +45,18 @@ function solution(array, commands) {
   }
   return answer;
 }
+
+// 정답 5 - chaerin-dev
+function solution(array, commands) {
+  let t = commands.length;
+  let answer = [];
+  while (t--) {
+    let command = commands.shift();
+    answer.push(
+      array.slice(command[0] - 1, command[1]).sort((a, b) => a - b)[
+        command[2] - 1
+      ]
+    );
+  }
+  return answer;
+}

level-1/로또의-최고-순위와-최저-순위.js

@@ -137,3 +137,16 @@ function solution(lottos, win_nums) {
 
   return [max, min]
 }
+
+//정답 7 - chaerin-dev
+function solution(lottos, win_nums) {
+  let zeroCount = 0;
+  let winCount = 0;
+  lottos.forEach((item) => {
+    if (item === 0) zeroCount++;
+    else if (win_nums.includes(item)) winCount++;
+  });
+  let maxRank = Math.min(7 - (winCount + zeroCount), 6);
+  let minRank = Math.min(7 - winCount, 6);
+  return [maxRank, minRank];
+}

level-1/부족한-금액-계산하기.js

@@ -46,4 +46,13 @@ function solution(price, money, count) {
   }
 
   return sum < money ? 0 : sum - money;
+}
+
+//정답 4 - chaerin-dev
+function solution(price, money, count) {
+    let totalPrice = 0;
+    for(let i=1; i<=count; i++){
+        totalPrice += i * price;
+    }
+    return money > totalPrice ? 0 : totalPrice-money;
 }