프로그래머스 [로또의 최고 순위와 최저 순위]

 

나의 풀이

function solution(lottos, win_nums) {
  var answer = [];
  var min = 0;
  var w = 0;
  var max = 0;
  for (var i in lottos) {
    if (win_nums.indexOf(lottos[i]) > -1) {
      min += 1;
    }
    if (lottos[i] == 0) {
      w += 1;
    }
  }

  max = min + w;

  if (max > 1) {
    max = 7 - max;
  } else max = 6;

  if (min > 1) {
    min = 7 - min;
  } else min = 6;

  answer = [max, min];
  return answer;
}

 

 

best 풀이

function solution(lottos, win_nums) {
    const rank = [6, 6, 5, 4, 3, 2, 1];

    let minCount = lottos.filter(v => win_nums.includes(v)).length;
    let zeroCount = lottos.filter(v => !v).length;

    const maxCount = minCount + zeroCount;

    return [rank[maxCount], rank[minCount]];
}