Todos los desafíos
Intermedio 0 resueltos 0% de aceptación

Ticket Lottery Winners

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

Lo que aprenderás

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

Problema

Ver traducción

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.

Restricciones

1 ≤ len(winning) ≤ 10

0 ≤ number of tickets ≤ 5,000

1 ≤ every number ≤ 99

Ejemplos

Ejemplo 1
Entrada:
winning = [3, 11, 20]
tickets = [
    [3, 11, 20],
    [20, 5, 7],
    [1, 2, 4],
    [11, 3, 9]
]

Salida esperada:
expected = [1, 1, 1, 1]
Entrada:
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}
};

Salida esperada:
std::vector<long long> expected = {1, 1, 1, 1};
Entrada:
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}
};

Salida esperada:
long[] expected = new long[] {1, 1, 1, 1};

Explicación

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

Ejemplo 2
Entrada:
winning = [7, 8]
tickets = [
    [8, 7],
    [7, 1],
    [1, 7]
]

Salida esperada:
expected = [0, 2, 1]
Entrada:
std::vector<long long> winning = {7, 8};
std::vector<std::vector<long long>> tickets = {
    {8, 7},
    {7, 1},
    {1, 7}
};

Salida esperada:
std::vector<long long> expected = {0, 2, 1};
Entrada:
long[] winning = new long[] {7, 8};
long[][] tickets = new long[][] {
    new long[] {8, 7},
    new long[] {7, 1},
    new long[] {1, 7}
};

Salida esperada:
long[] expected = new long[] {0, 2, 1};

Explicación

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

Cómo abordarlo

Inténtalo primero por tu cuenta y luego abre las pistas una a una.

Pista 1

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

Pista 2

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

Pista 3

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

Complejidad esperada

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

Referencias

Este reto está adaptado para CodeUtility. Sigue el enunciado y las restricciones indicadas arriba.

Clasificación

Clasificación completa

La mejor solución aprobada de cada programador. Las más rápidas, ligeras y mejor valoradas van primero.

Aún no hay soluciones aprobadas. Resuélvelo y quédate el primer puesto.

Aprende de otros

Soluciones de la comunidad

Aún no hay soluciones publicadas. Resuelve este reto para compartir la primera.