[심민보]프로그래머스 Lv 0 마무리

프로그래머스 Lv0/구슬을 나누는 경우의 수.js

@@ -0,0 +1,14 @@
+function solution(balls, share) {
+  var answer = factorial(balls) / (factorial(balls - share) * factorial(share));
+  return answer;
+}
+
+function factorial(num) {
+  let mul = BigInt(1);
+  for (let i = num; i >= 1; i--) {
+    mul *= BigInt(i);
+  }
+  return mul;
+}
+
+console.log(solution(6, 3));

프로그래머스 Lv0/그림 확대.js

@@ -0,0 +1,22 @@
+function solution(picture, k) {
+  var answer = [];
+  let arr = [];
+  for (let i = 0; i < picture.length; i++) {
+    picture[i] = picture[i].split("");
+    for (let j = 0; j < picture[i].length; j++) {
+      arr = picture[i][j];
+      for (let z = 0; z < k - 1; z++) {
+        picture[i][j] += arr;
+      }
+    }
+    picture[i] = picture[i].join("");
+  }
+  for (let i = 0; i < picture.length; i++) {
+    for (let j = 0; j < k; j++) {
+      answer.push(picture[i]);
+    }
+  }
+  return answer;
+}
+
+console.log(solution(["x.x", ".x.", "x.x"], 3));

프로그래머스 Lv0/두 수의합 2.js

@@ -0,0 +1,4 @@
+function solution(a, b) {
+  var answer = (BigInt(a) + BigInt(b)).toString();
+  return answer;
+}

프로그래머스 Lv0/무작워로 K개의 수 뽑기.js

@@ -0,0 +1,15 @@
+function solution(arr, k) {
+  var answer = [];
+  for (let i = 0; i < arr.length; i++) {
+    if (answer.length === k) {
+      break;
+    }
+    if (!answer.includes(arr[i])) {
+      answer.push(arr[i]);
+    }
+  }
+  while (answer.length < k) {
+    answer.push(-1);
+  }
+  return answer;
+}

프로그래머스 Lv0/문자열 계산하기.js

@@ -0,0 +1,13 @@
+function solution(my_string) {
+  const arr = my_string.split(" ");
+  var answer = Number(arr[0]);
+  for (let i = 1; i < arr.length - 1; i += 2) {
+    if (arr[i] == "+") {
+      answer += Number(arr[i + 1]);
+    } else {
+      answer -= Number(arr[i + 1]);
+    }
+  }
+
+  return answer;
+}

프로그래머스 Lv0/문자열 여러 번 뒤집기.js

@@ -0,0 +1,23 @@
+function solution(my_string, queries) {
+  var answer = "";
+  for (let i = 0; i < queries.length; i++) {
+    let [start, end] = queries[i];
+    let arr = my_string
+      .slice(start, end + 1)
+      .split("")
+      .reverse();
+    my_string = my_string.split("");
+    my_string.splice(start, end - start + 1, ...arr);
+    my_string = my_string.join("");
+  }
+  return my_string;
+}
+
+console.log(
+  solution("rermgorpsam", [
+    [2, 3],
+    [0, 7],
+    [5, 9],
+    [6, 10],
+  ])
+);

프로그래머스 Lv0/배열 만들기 6.js

@@ -0,0 +1,14 @@
+function solution(arr) {
+  var answer = [];
+  for (let i = 0; i < arr.length; i++) {
+    if (answer.length == 0) {
+      answer.push(arr[i]);
+    } else if (answer[answer.length - 1] == arr[i]) {
+      answer.pop();
+    } else {
+      answer.push(arr[i]);
+    }
+  }
+  answer = answer.length == 0 ? [-1] : answer;
+  return answer;
+}

프로그래머스 Lv0/배열 조각하기.js

@@ -0,0 +1,11 @@
+function solution(arr, query) {
+  var answer = [];
+  for (let i = 0; i < query.length; i++) {
+    if (i % 2 == 0) {
+      arr.splice(query[i] + 1);
+    } else {
+      arr.splice(0, query[i]);
+    }
+  }
+  return arr;
+}

프로그래머스 Lv0/삼각형의 완성조건 (2).js

@@ -0,0 +1,13 @@
+function solution(sides) {
+  var answer = 0;
+
+  for (let i = 1; i < sides[0] + sides[1]; i++) {
+    const arr = [...sides];
+    arr.push(i);
+    arr.sort((a, b) => a - b);
+    if (arr[0] + arr[1] > arr[2]) {
+      answer++;
+    }
+  }
+  return answer;
+}

프로그래머스 Lv0/영어가 싫어요.js

@@ -0,0 +1,26 @@
+function solution(numbers) {
+  var answer = "";
+  const num = {
+    zero: 0,
+    one: 1,
+    two: 2,
+    three: 3,
+    four: 4,
+    five: 5,
+    six: 6,
+    seven: 7,
+    eight: 8,
+    nine: 9,
+  };
+  let str = "";
+  for (let i = 0; i < numbers.length; i++) {
+    str += numbers[i];
+    if (str in num) {
+      answer += num[str];
+      str = "";
+    }
+  }
+  return Number(answer);
+}
+
+console.log(solution("onetwothreefourfivesixseveneightnine"));

프로그래머스 Lv0/왼쪽 오른쪽.js

@@ -0,0 +1,11 @@
+function solution(str_list) {
+  const index = str_list.findIndex((item) => item === "l" || item === "r");
+
+  if (index === -1) {
+    return [];
+  } else if (str_list[index] === "l") {
+    return str_list.slice(0, index);
+  } else {
+    return str_list.slice(index + 1);
+  }
+}

프로그래머스 Lv0/전국 대회 선발 고사.js

@@ -0,0 +1,16 @@
+function solution(rank, attendance) {
+  var answer = 0;
+  const order = {};
+  rank.forEach((people, idx) => (order[people] = idx));
+  const filterRank = rank.filter((people, idx) => attendance[idx] === true);
+  filterRank.sort((a, b) => a - b);
+  answer =
+    order[filterRank[0]] * 10000 +
+    order[filterRank[1]] * 100 +
+    order[filterRank[2]];
+  return answer;
+}
+
+console.log(
+  solution([3, 7, 2, 5, 4, 6, 1], [false, true, true, true, true, false, false])
+);

프로그래머스 Lv0/정사각형으로 만들기.js

@@ -0,0 +1,25 @@
+function solution(arr) {
+  var answer = [...arr];
+
+  if (answer.length < answer[0].length) {
+    for (let i = 0; i < answer[0].length - answer.length; i++) {
+      arr.push(Array(answer[0].length).fill(0));
+    }
+  } else if (answer.length > answer[0].length) {
+    for (let j = 0; j < answer.length; j++) {
+      for (let i = 0; i < answer.length - answer[j].length; i++) {
+        arr[j].push(0);
+      }
+    }
+  }
+  return arr;
+}
+
+console.log(
+  solution([
+    [572, 22, 37],
+    [287, 726, 384],
+    [85, 137, 292],
+    [487, 13, 876],
+  ])
+);