Package g2801_2900.s2834_find_the_minimum_possible_sum_of_a_beautiful_array

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    2834 - Find the Minimum Possible Sum of a Beautiful Array\.

    Medium

    You are given positive integers n and target.

    An array nums is beautiful if it meets the following conditions:

    • nums.length == n.

    • nums consists of pairwise distinct positive integers.

    • There doesn't exist two distinct indices, i and j, in the range [0, n - 1], such that nums[i] + nums[j] == target.

    Return the minimum possible sum that a beautiful array could have modulo <code>10<sup>9</sup> + 7</code>.

    Example 1:

    Input: n = 2, target = 3

    Output: 4

    Explanation: We can see that nums = 1,3 is beautiful.

    • The array nums has length n = 2.

    • The array nums consists of pairwise distinct positive integers.

    • There doesn't exist two distinct indices, i and j, with numsi + numsj == 3.

    It can be proven that 4 is the minimum possible sum that a beautiful array could have.

    Example 2:

    Input: n = 3, target = 3

    Output: 8

    Explanation: We can see that nums = 1,3,4 is beautiful.

    • The array nums has length n = 3.

    • The array nums consists of pairwise distinct positive integers.

    • There doesn't exist two distinct indices, i and j, with numsi + numsj == 3.

    It can be proven that 8 is the minimum possible sum that a beautiful array could have.

    Example 3:

    Input: n = 1, target = 1

    Output: 1

    Explanation: We can see, that nums = 1 is beautiful.

    Constraints:

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

    • <code>1 <= target <= 10<sup>9</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 minimumPossibleSum(Integer n, Integer target)

      • Methods inherited from class java.lang.Object

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