{"id":9992,"date":"2023-04-27T21:23:08","date_gmt":"2023-04-28T04:23:08","guid":{"rendered":"https:\/\/zxi.mytechroad.com\/blog\/?p=9992"},"modified":"2023-04-27T21:29:07","modified_gmt":"2023-04-28T04:29:07","slug":"leetcode-2652-sum-multiples","status":"publish","type":"post","link":"https:\/\/zxi.mytechroad.com\/blog\/math\/leetcode-2652-sum-multiples\/","title":{"rendered":"\u82b1\u82b1\u9171 LeetCode 2652. Sum Multiples"},"content":{"rendered":"\n

Given a positive integer n<\/code>, find the sum of all integers in the range [1, n]<\/code> inclusive<\/strong> that are divisible by 3<\/code>, 5<\/code>, or 7<\/code>.<\/p>\n\n\n\n

Return an integer denoting the sum of all numbers in the given range satisfying the constraint.<\/em><\/p>\n\n\n\n

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

Input:<\/strong> n = 7\nOutput:<\/strong> 21\nExplanation:<\/strong> Numbers in the range [1, 7]<\/code> that are divisible by 3<\/code>, 5,<\/code> or 7 <\/code>are 3, 5, 6, 7<\/code>. The sum of these numbers is 21<\/code>.\n<\/pre>\n\n\n\n
Example 2:<\/strong><\/p>\n\n\n\n
Input:<\/strong> n = 10\nOutput:<\/strong> 40\nExplanation:<\/strong> Numbers in the range [1, 10] that are<\/code> divisible by 3<\/code>, 5,<\/code> or 7<\/code> are 3, 5, 6, 7, 9, 10<\/code>. The sum of these numbers is 40.\n<\/pre>\n\n\n\n
Example 3:<\/strong><\/p>\n\n\n\n
Input:<\/strong> n = 9\nOutput:<\/strong> 30\nExplanation:<\/strong> Numbers in the range [1, 9]<\/code> that are divisible by 3<\/code>, 5<\/code>, or 7<\/code> are 3, 5, 6, 7, 9<\/code>. The sum of these numbers is 30<\/code>.\n<\/pre>\n\n\n\n
Constraints:<\/strong><\/p>\n\n\n\n
  • 1 <= n <= 103<\/sup><\/code><\/li><\/ul>\n\n\n\n
    Solution: Mod<\/strong><\/h2>\n\n\n\n
    Time complexity: O(n)
    Space complexity: O(1)<\/p>\n\n\n\n
    \n
    C++<\/h2>\n
    \n\n
    \n\/\/ Author: Huahua\nclass Solution {\npublic:\n  int sumOfMultiples(int n) {\n    int ans = 0;\n    for (int i = 1; i <= n; ++i) {\n      if (i % 3 == 0 || i % 5 == 0 || i % 7 == 0)\n        ans += i;\n    }\n    return ans;\n  }\n};\n<\/pre>\n<\/div><\/div>\n","protected":false},"excerpt":{"rendered":"
    Given a positive integer n, find the sum of all integers in the range [1, n] inclusive that are divisible by 3, 5, or 7. Return an integer denoting the sum of all…<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[49],"tags":[222,31,158],"class_list":["post-9992","post","type-post","status-publish","format-standard","hentry","category-math","tag-easy","tag-math","tag-mod","entry","simple"],"_links":{"self":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/9992","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=9992"}],"version-history":[{"count":2,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/9992\/revisions"}],"predecessor-version":[{"id":9994,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/9992\/revisions\/9994"}],"wp:attachment":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/media?parent=9992"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/categories?post=9992"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/tags?post=9992"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}