1_12.反转数组

Reverse Array

public void reverseArray(int[] array){
  int left = 0;
  int right = array.length;
  int temp = 0; 
  while(left < right){
    temp = array[left];
    array[left] = array[right];
    array[right] = temp;
    left++;
    right--;
    return;
  }
}

递归

public void reverseArray(int[] array, int left, int right){
    if(left >= right) return;
    int temp = array[left];
    array[left] = array[right];
    array[right] = temp;
    reverseArray(array, ++left, --right);
    return;
}