12345678910111213141516171819202122232425262728293031323334
class Solution {
public:
vector<int> reverseArray(vector<int>& nums) {
// Call the helper function to reverse the array
reverse(nums, 0, nums.size() - 1);
// Return the reversed array
return nums;
}
// Helper method to reverse the array using recursion
private:
void reverse(vector<int>& nums, int left, int right) {
if (left >= right) {
return;
}
// Swap the elements
int temp = nums[left];
nums[left] = nums[right];
nums[right] = temp;
// Recursive call with updated pointers
reverse(nums, left + 1, right - 1);
}
};
int main() {
Solution solution;
vector<int> nums = {1, 2, 3, 4, 5};
vector<int> result = solution.reverseArray(nums);
for (int num : result) {
cout << num << " ";
}
return 0;
}
12345678910111213141516171819202122232425262728293031323334
class Solution {
public int[] reverseArray(int[] nums) {
// Call the helper function to reverse the array
reverse(nums, 0, nums.length - 1);
// Return the reversed array
return nums;
}
private void reverse(int[] nums, int left, int right) {
// Base case: pointers have crossed, the array is reversed
if (left >= right) {
return;
}
// Swap the elements
int temp = nums[left];
nums[left] = nums[right];
nums[right] = temp;
// Recursive call with updated pointers
reverse(nums, left + 1, right - 1);
}
}
// Main method for testing the reverseArray function
public class Main {
public static void main(String[] args) {
Solution solution = new Solution();
int[] nums = {1, 2, 3, 4, 5};
int[] result = solution.reverseArray(nums);
for (int num : result) {
System.out.print(num + " ");
}
}
}
12345678910111213141516171819202122
class Solution:
def reverseArray(self, nums):
# Call the helper function to reverse the array
self.reverse(nums, 0, len(nums) - 1)
# Return the reversed array
return nums
def reverse(self, nums, left, right):
if left >= right:
return
# Swap the elements
nums[left], nums[right] = nums[right], nums[left]
# Recursive call with updated pointers
self.reverse(nums, left + 1, right - 1)
# Main method for testing the reverseArray function
if __name__ == "__main__":
solution = Solution()
nums = [1, 2, 3, 4, 5]
result = solution.reverseArray(nums)
print(result) # Print the reversed array
123456789101112131415161718192021222324252627
class Solution {
// Method to reverse the array
reverseArray(nums) {
// Call the helper function to reverse the array
this.reverse(nums, 0, nums.length - 1);
// Return the reversed array
return nums;
}
// Helper method to reverse the array using recursion
reverse(nums, left, right) {
if (left >= right) {
return;
}
// Swap the elements
[nums[left], nums[right]] = [nums[right], nums[left]];
// Recursive call with updated pointers
this.reverse(nums, left + 1, right - 1);
}
}
// Main method for testing the reverseArray function
const solution = new Solution();
const nums = [1, 2, 3, 4, 5];
const result = solution.reverseArray(nums);
console.log(result);
