मध्यम 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 के लिए अनुकूलित की गई है। ऊपर दिए गए स्टेटमेंट और सीमाओं का पालन करें।

हर कोडर का सबसे अच्छा पास हुआ समाधान। तेज़, कम मेमोरी वाले और बेहतर रेटिंग वाले समाधान ऊपर रहते हैं।

अभी कोई पास हुआ समाधान नहीं है। इसे हल करें और पहला स्थान पाएँ।

दूसरों से सीखें

समुदाय समाधान

अभी तक कोई प्रकाशित समाधान नहीं। पहला साझा करने के लिए इस चुनौती को हल करें।