Package g2601_2700.s2652_sum_multiples

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    2652 - Sum Multiples.

    Easy

    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 numbers in the given range satisfying the constraint.

    Example 1:

    Input: n = 7

    Output: 21

    Explanation: Numbers in the range [1, 7] that are divisible by 3, 5, or 7 are 3, 5, 6, 7. The sum of these numbers is 21.

    Example 2:

    Input: n = 10

    Output: 40

    Explanation: Numbers in the range [1, 10] that are divisible by 3, 5, or 7 are 3, 5, 6, 7, 9, 10. The sum of these numbers is 40.

    Example 3:

    Input: n = 9

    Output: 30

    Explanation: Numbers in the range [1, 9] that are divisible by 3, 5, or 7 are 3, 5, 6, 7, 9. The sum of these numbers is 30.

    Constraints:

    • <code>1 <= n <= 10<sup>3</sup></code>

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer sumOfMultiples(Integer n)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait