Java Classic Small algorithm

Package Com.shb.java;public class Demo4 {/** time limited do not write the text of their own random knock * @param args * @author shaobn */public static void Main (St Ring[] (args) {//TODO auto-generated method Stub//system.out.println (Getdir);//getmethod (New int[]{ 0,15,23,455,45,12}); Getmethod_2 (new int[]{1,45,848,66});} Up stairs problem public static int Getdir (int n) {if (n==1) {return 1;} else if (n==2) {return 2;} else if (n>2) {return Getdir (n-1) +getdir (n-2);} return 1;} Move the array forward, the last one for the original array, the first public static void GetMethod (int[] array) {int temp =0;int cur = 0;for (int i=0;i< array.length;i++) {if (i==0) {temp = array[i];continue;} Array[cur] = array[i];cur++;if (i==array.length-1) {array[i] = temp;}} for (int i:array) {System.out.println (i);}} Reverse array output public static void Getmethod_2 (int[] array) {if (array.length%2==0) {int tmp = 0;for (int i=0;i<array.length/2 ; i++) {tmp=array[i];array[i] = array[array.length-i-1];array[array.length-i-1]=tmp;} for (int i:array) {System.out.println (i);}} else {int tmp = 0;for (int i=0;i< (array.length-1)/2;i++) {TMp = array[i];array[i] = array[array.length-i-1];array[array.length-i-1]=tmp;} for (int i:array) {System.out.println (i);}}}}

Java Classic Small algorithm