Dec 26, 2022 · Dec 26, 2022
diff --git a/level-2/k진수에서-소수-개수-구하기&92335&.js b/level-2/k진수에서-소수-개수-구하기&92335&.js
    // .split('0') // 0을 기준으로 나눕니다.
    // .filter((number) => isPrime(+number)).length // 소수가 아닌 요소를 걸러낸 후에 개수를 셉니다.
    return (n).toString(k).split('0').filter((number) => isPrime(+number)).length;
 }
 }


 // 정답 2 - ryna-dia

 function solution(n, k) {
  const numbers = n;
  const antilogarithm = k;
  const NumbersChangedAntilogarithm = numbers.toString(antilogarithm);
  const result = selectPrimeNotIncludeZero(NumbersChangedAntilogarithm);

  return result.length;
 }

 function selectPrimeNotIncludeZero(numbers, numbersWithoutZero = '') {
  return [...numbers].reduce((acc, cur, index, arr) => {
    if (cur !== '0') numbersWithoutZero += cur;
    if (cur === '0' || index === arr.length - 1) {
      if (isPrime(Number(numbersWithoutZero))) acc.push(numbersWithoutZero);
      numbersWithoutZero = '';
    }
    return acc;
  }, []);
 }

 function isPrime(num) {
  if (!num || num === 1) return false;
  for (let i = 2; i <= Math.sqrt(num); i++) {
    if (!(num % i)) return false;
  }
  return true;
 }
diff --git a/level-2/프린터&42587&.js b/level-2/프린터&42587&.js
        return this.rear - this.front
    }
 }

 // 정답 6 ryan-dia

 function solution(priorities, location, result = 0) {
  const queue = priorities.map((p, i) => ({ priority: p, index: i }));

  while (queue.length > 0) {
    const current = queue.shift();
    const higherPriority = queue.some((d) => d.priority > current.priority);

    if (higherPriority) {
      queue.push(current);
      continue;
    }
    result += 1;
    if (current.index === location) {
      return result;
    }
  }
 }
Original file line number	Diff line number	Diff line change
Expand Up		@@ -20,4 +20,35 @@ function solution(n, k) {
		// .split('0') // 0을 기준으로 나눕니다.
		// .filter((number) => isPrime(+number)).length // 소수가 아닌 요소를 걸러낸 후에 개수를 셉니다.
		return (n).toString(k).split('0').filter((number) => isPrime(+number)).length;
		}
		}


		// 정답 2 - ryna-dia

		function solution(n, k) {
		const numbers = n;
		const antilogarithm = k;
		const NumbersChangedAntilogarithm = numbers.toString(antilogarithm);
		const result = selectPrimeNotIncludeZero(NumbersChangedAntilogarithm);

		return result.length;
		}

		function selectPrimeNotIncludeZero(numbers, numbersWithoutZero = '') {
		return [...numbers].reduce((acc, cur, index, arr) => {
		if (cur !== '0') numbersWithoutZero += cur;
		if (cur === '0' \|\| index === arr.length - 1) {
		if (isPrime(Number(numbersWithoutZero))) acc.push(numbersWithoutZero);
		numbersWithoutZero = '';
		}
		return acc;
		}, []);
		}

		function isPrime(num) {
		if (!num \|\| num === 1) return false;
		for (let i = 2; i <= Math.sqrt(num); i++) {
		if (!(num % i)) return false;
		}
		return true;
		}
Original file line number	Diff line number	Diff line change
Expand Up		@@ -134,3 +134,24 @@ class Queue {
		return this.rear - this.front
		}
		}

		// 정답 6 ryan-dia

		function solution(priorities, location, result = 0) {
		const queue = priorities.map((p, i) => ({ priority: p, index: i }));

		while (queue.length > 0) {
		const current = queue.shift();
		const higherPriority = queue.some((d) => d.priority > current.priority);

		if (higherPriority) {
		queue.push(current);
		continue;
		}
		result += 1;
		if (current.index === location) {
		return result;
		}
		}
		}