Reverse an Array

You are given an integer array nums.

Your task is to reverse the order of elements in the array in-place.

You must modify the original array directly without creating another array for the result.

The solution should run in:

• O(n) time complexity

• O(1) extra space complexity

📥 Input

• An integer array nums

📤 Output

Return the modified array after reversing its elements.

🧪 Example 1

Input

nums = [1, 2, 3, 4, 5, 6]

Output

[6, 5, 4, 3, 2, 1]

Explanation

The array is reversed in-place by swapping elements from both ends.

Constraints

• 1 ≤ nums.length ≤ 10^5

• -10^9 ≤ nums[i] ≤ 10^9