Find N Unique Integers Sum up to Zero

Given an integer n, return any array containing n unique integers such that they add up to 0.

LeetCode Problem - 1304

class Solution {
    // Method to generate an array of n integers with a sum of zero
    public int[] sumZero(int n) {
        // Creating an array to store the result
        int[] result = new int[n];
        // Setting the limit for positive and negative numbers
        int limit = 1000;
        // Calculating the number of symmetric elements
        int symmetric = n / 2;

        // Filling the first half of the array with positive integers decreasing from limit
        int idx = 0;
        for (int i = 0; i < symmetric; i++) {
            result[idx] = limit;
            limit--;
            idx++;
        }

        // Resetting the limit for negative numbers
        limit = 1000;
        // Filling the second half of the array with negative integers increasing from -limit
        for (int i = 0; i < symmetric; i++) {
            result[idx] = (limit * (-1));
            limit--;
            idx++;
        }

        // Adding zero if n is odd
        if (n % 2 != 0) {
            result[n - 1] = 0;
        }

        // Returning the result array
        return result;
    }
}