2485. Find the Pivot Integer

class Solution {
    public int pivotInteger(int n) {
       	int i = 0, sum = 0,
    		pivot = n * (n + 1) / 2, x;

        while (i != n) {
            sum = i * (i + 1) / 2;
            x = pivot - sum;
            sum += ++i;
            if (x == sum) return i;
        }
        return -1; 
    }
}