int [ ] function ( int [ ] arg0 , int arg1 ) { if ( arg0 == null || arg0 . length < 2 ) return arg0 ; arg1 = arg1 % arg0 . length ; reverseArray ( arg0 , 0 , arg0 . length - arg1 - 1 ) ; reverseArray ( arg0 , arg0 . length - arg1 , arg0 . length - 1 ) ; reverseArray ( arg0 , 0 , arg0 . length - 1 ) ; return arg0 ; }
o 1 space solution , o n time rotate is a good idea in solving these problems . concode_field_sep PlaceHolder placeHolder concode_field_sep int[] rotate concode_elem_sep void reverseArray concode_elem_sep void main