{"id":9722,"date":"2022-05-03T17:56:59","date_gmt":"2022-05-04T00:56:59","guid":{"rendered":"https:\/\/zxi.mytechroad.com\/blog\/?p=9722"},"modified":"2022-05-03T17:57:14","modified_gmt":"2022-05-04T00:57:14","slug":"leetcode-2260-minimum-consecutive-cards-to-pick-up","status":"publish","type":"post","link":"https:\/\/zxi.mytechroad.com\/blog\/hashtable\/leetcode-2260-minimum-consecutive-cards-to-pick-up\/","title":{"rendered":"\u82b1\u82b1\u9171 LeetCode 2260. Minimum Consecutive Cards to Pick Up"},"content":{"rendered":"\n

You are given an integer array cards<\/code> where cards[i]<\/code> represents the value<\/strong> of the ith<\/sup><\/code> card. A pair of cards are matching<\/strong> if the cards have the same<\/strong> value.<\/p>\n\n\n\n

Return the minimum<\/strong> number of consecutive<\/strong> cards you have to pick up to have a pair of matching<\/strong> cards among the picked cards.<\/em> If it is impossible to have matching cards, return -1<\/code>.<\/p>\n\n\n\n

Example 1:<\/strong><\/p>\n\n\n\n

Input:<\/strong> cards = [3,4,2,3,4,7]\nOutput:<\/strong> 4\nExplanation:<\/strong> We can pick up the cards [3,4,2,3] which contain a matching pair of cards with value 3. Note that picking up the cards [4,2,3,4] is also optimal.\n<\/pre>\n\n\n\n
Example 2:<\/strong><\/p>\n\n\n\n
Input:<\/strong> cards = [1,0,5,3]\nOutput:<\/strong> -1\nExplanation:<\/strong> There is no way to pick up a set of consecutive cards that contain a pair of matching cards.\n<\/pre>\n\n\n\n
Constraints:<\/strong><\/p>\n\n\n\n
  • 1 <= cards.length <= 105<\/sup><\/code><\/li>
  • 0 <= cards[i] <= 106<\/sup><\/code><\/li><\/ul>\n\n\n\n
    Solution: Hashtable<\/strong><\/h2>\n\n\n\n
    Record the last position of each number,
    ans = min{cardi<\/sub> – last[cardi<\/sub>]}<\/p>\n\n\n\n
    Time complexity: O(n)
    Space complexity: O(n)<\/p>\n\n\n\n
    \n
    C++<\/h2>\n
    \n\n
    \n\/\/ Author: Huahua\nclass Solution {\npublic:\n  int minimumCardPickup(vector& cards) {\n    const int n = cards.size();\n    unordered_map m;\n    int ans = INT_MAX;\n    for (int i = 0; i < n; ++i) {\n      if (m.count(cards[i]))\n        ans = min(ans, i - m[cards[i]] + 1);\n      m[cards[i]] = i;\n    }\n    return ans == INT_MAX ? -1 : ans;\n  }\n};\n<\/pre>\n<\/div><\/div>\n","protected":false},"excerpt":{"rendered":"
    You are given an integer array cards where cards[i] represents the value of the ith card. A pair of cards are matching if the cards have the same value. Return the minimum number of consecutive cards you have to pick up to…<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[70],"tags":[82,177],"class_list":["post-9722","post","type-post","status-publish","format-standard","hentry","category-hashtable","tag-hashtable","tag-medium","entry","simple"],"_links":{"self":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/9722","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/comments?post=9722"}],"version-history":[{"count":2,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/9722\/revisions"}],"predecessor-version":[{"id":9724,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/9722\/revisions\/9724"}],"wp:attachment":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/media?parent=9722"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/categories?post=9722"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/tags?post=9722"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}