• Home
• com.github.javadev
• leetcode-in-java
• 1.38
• source code
• readme.md

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

g2401_2500.s2485_find_the_pivot_integer.readme.md Maven / Gradle / Ivy

2485\. Find the Pivot Integer

Easy

Given a positive integer `n`, find the **pivot integer** `x` such that:

*   The sum of all elements between `1` and `x` inclusively equals the sum of all elements between `x` and `n` inclusively.

Return _the pivot integer_ `x`. If no such integer exists, return `-1`. It is guaranteed that there will be at most one pivot index for the given input.

**Example 1:**

**Input:** n = 8

**Output:** 6

**Explanation:** 6 is the pivot integer since: 1 + 2 + 3 + 4 + 5 + 6 = 6 + 7 + 8 = 21.

**Example 2:**

**Input:** n = 1

**Output:** 1

**Explanation:** 1 is the pivot integer since: 1 = 1.

**Example 3:**

**Input:** n = 4

**Output:** -1

**Explanation:** It can be proved that no such integer exist.

**Constraints:**

*   `1 <= n <= 1000`