{"id":7294,"date":"2020-08-23T10:51:03","date_gmt":"2020-08-23T17:51:03","guid":{"rendered":"https:\/\/zxi.mytechroad.com\/blog\/?p=7294"},"modified":"2020-08-23T10:51:19","modified_gmt":"2020-08-23T17:51:19","slug":"leetcode-1560-most-visited-sector-in-a-circular-track","status":"publish","type":"post","link":"https:\/\/zxi.mytechroad.com\/blog\/simulation\/leetcode-1560-most-visited-sector-in-a-circular-track\/","title":{"rendered":"\u82b1\u82b1\u9171 LeetCode 1560. Most Visited Sector in a Circular Track"},"content":{"rendered":"\n

Given an integer n<\/code> and an integer array rounds<\/code>. We have a circular track which consists of n<\/code> sectors labeled from 1<\/code> to n<\/code>. A marathon will be held on this track, the marathon consists of m<\/code> rounds. The ith<\/sup><\/code> round starts at sector rounds[i - 1]<\/code> and ends at sector rounds[i]<\/code>. For example, round 1 starts at sector rounds[0]<\/code> and ends at sector rounds[1]<\/code><\/p>\n\n\n\n

Return an array of the most visited sectors<\/em> sorted in ascending<\/strong> order.<\/p>\n\n\n\n

Notice that you circulate the track in ascending order of sector numbers in the counter-clockwise direction (See the first example).<\/p>\n\n\n\n

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

\"\"\/<\/figure>\n\n\n\n
Input:<\/strong> n = 4, rounds = [1,3,1,2]\nOutput:<\/strong> [1,2]\nExplanation:<\/strong> The marathon starts at sector 1. The order of the visited sectors is as follows:\n1 --> 2 --> 3 (end of round 1) --> 4 --> 1 (end of round 2) --> 2 (end of round 3 and the marathon)\nWe can see that both sectors 1 and 2 are visited twice and they are the most visited sectors. Sectors 3 and 4 are visited only once.<\/pre>\n\n\n\n
Example 2:<\/strong><\/p>\n\n\n\n
Input:<\/strong> n = 2, rounds = [2,1,2,1,2,1,2,1,2]\nOutput:<\/strong> [2]\n<\/pre>\n\n\n\n
Example 3:<\/strong><\/p>\n\n\n\n
Input:<\/strong> n = 7, rounds = [1,3,5,7]\nOutput:<\/strong> [1,2,3,4,5,6,7]\n<\/pre>\n\n\n\n
Constraints:<\/strong><\/p>\n\n\n\n
  • 2 <= n <= 100<\/code><\/li>
  • 1 <= m <= 100<\/code><\/li>
  • rounds.length == m + 1<\/code><\/li>
  • 1 <= rounds[i] <= n<\/code><\/li>
  • rounds[i] != rounds[i + 1]<\/code> for 0 <= i < m<\/code><\/li><\/ul>\n\n\n\n
    Solution: Simulation<\/strong><\/h2>\n\n\n\n
    Time complexity: O(m*n)
    Space complexity: O(n)<\/p>\n\n\n\n
    \n
    C++<\/h2>\n
    \n\n
    \nclass Solution {\npublic:\n  vector mostVisited(int n, vector& rounds) {\n    vector counts(n);\n    counts[rounds[0] - 1] = 1;\n    for (int i = 1; i < rounds.size(); ++i)\n      for (int s = rounds[i - 1]; ; ++s) {\n        ++counts[s %= n];\n        if (s == rounds[i] - 1) break;\n      }\n    const int max_count = *max_element(begin(counts), end(counts));\n    vector ans;\n    for (int i = 0; i < n; ++i)      \n      if (counts[i] == max_count) ans.push_back(i + 1);    \n    return ans;\n  }\n};\n<\/pre>\n<\/div><\/div>\n","protected":false},"excerpt":{"rendered":"
    Given an integer n and an integer array rounds. We have a circular track which consists of n sectors labeled from 1 to n. A marathon will be held on this track, the marathon consists…<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[48],"tags":[222,158,643,179],"class_list":["post-7294","post","type-post","status-publish","format-standard","hentry","category-simulation","tag-easy","tag-mod","tag-round","tag-simulation","entry","simple"],"_links":{"self":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/7294","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=7294"}],"version-history":[{"count":2,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/7294\/revisions"}],"predecessor-version":[{"id":7296,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/7294\/revisions\/7296"}],"wp:attachment":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/media?parent=7294"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/categories?post=7294"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/tags?post=7294"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}