모든 챌린지
보통 0명 해결 정답률 0%

Ticket Lottery Winners

Count how many lottery tickets matched 0, 1, 2, ... of the winning numbers.

배우게 될 내용

  • Use a set to test membership quickly
  • Count matches per ticket
  • Build a histogram of scores

문제

번역본 보기

A school fundraiser runs a number lottery. The draw picks some distinct winning numbers, and every ticket has the same amount of distinct numbers. The order of numbers on a ticket does not matter; a ticket's score is how many of its numbers are winning numbers. To set the prizes, the organizers need to know how many tickets reached each score.

Implement ticket_lottery(winning, tickets).

Input

winning: The distinct winning numbers.

tickets: The tickets; each row holds the distinct numbers on one ticket, with the same length as winning.

Output

Return a list of length len(winning) + 1 where position k is the number of tickets that matched exactly k winning numbers.

제약 조건

1 ≤ len(winning) ≤ 10

0 ≤ number of tickets ≤ 5,000

1 ≤ every number ≤ 99

예시

예시 1
입력:
winning = [3, 11, 20]
tickets = [
    [3, 11, 20],
    [20, 5, 7],
    [1, 2, 4],
    [11, 3, 9]
]

예상 출력:
expected = [1, 1, 1, 1]
입력:
std::vector<long long> winning = {3, 11, 20};
std::vector<std::vector<long long>> tickets = {
    {3, 11, 20},
    {20, 5, 7},
    {1, 2, 4},
    {11, 3, 9}
};

예상 출력:
std::vector<long long> expected = {1, 1, 1, 1};
입력:
long[] winning = new long[] {3, 11, 20};
long[][] tickets = new long[][] {
    new long[] {3, 11, 20},
    new long[] {20, 5, 7},
    new long[] {1, 2, 4},
    new long[] {11, 3, 9}
};

예상 출력:
long[] expected = new long[] {1, 1, 1, 1};

설명

The tickets match 3, 1, 0 and 2 numbers, so each score from 0 to 3 happens once: [1, 1, 1, 1].

예시 2
입력:
winning = [7, 8]
tickets = [
    [8, 7],
    [7, 1],
    [1, 7]
]

예상 출력:
expected = [0, 2, 1]
입력:
std::vector<long long> winning = {7, 8};
std::vector<std::vector<long long>> tickets = {
    {8, 7},
    {7, 1},
    {1, 7}
};

예상 출력:
std::vector<long long> expected = {0, 2, 1};
입력:
long[] winning = new long[] {7, 8};
long[][] tickets = new long[][] {
    new long[] {8, 7},
    new long[] {7, 1},
    new long[] {1, 7}
};

예상 출력:
long[] expected = new long[] {0, 2, 1};

설명

One ticket has both numbers (order does not matter) and two have one: [0, 2, 1].

접근 방법

먼저 스스로 풀어 본 뒤 힌트를 하나씩 열어 보세요.

힌트 1

Put the winning numbers in a set or a boolean array indexed by number.

힌트 2

Count matches on one ticket, then add 1 to that score's bucket.

힌트 3

The result has one more bucket than there are winning numbers.

예상 복잡도

O(t × k) time, O(k) extra space

참고 자료

이 문제는 CodeUtility에 맞게 수정되었습니다. 위의 설명과 제한 조건을 따르세요.

코더마다 가장 좋은 통과 풀이입니다. 더 빠르고, 메모리를 덜 쓰고, 평가가 좋은 풀이가 위에 옵니다.

아직 통과한 풀이가 없습니다. 풀어서 1위를 차지하세요.

다른 사람의 풀이 보기

커뮤니티 솔루션

아직 공개된 풀이가 없습니다. 문제를 풀고 첫 풀이를 공유하세요.