50 typical Java programming questions, 50 java programming questions

50 typical Java programming questions, 50 java programming questions

There are n integers, so that the previous numbers are shifted to the next m positions, and the last m number is changed to the first m number.

Public class Example36 {
Public static void main (String [] args ){
Int [] m = {18, 12, 23, 34, 95, 76, 57, 28, 9 };
MoveElement (m, 5 );
}

Public static void moveElement (int [] m, int n ){
System. out. print ("the array before the shift is :");
For (int r: m ){
System. out. print (r + "");
}

If (n <= m. length ){
Int [] B = new int [m. length];
For (int I = 0; I <m. length-n; I ++ ){
B [I + n] = m [I];
}
Int j = 0;
For (int I = m. length-n; I <m. length; I ++ ){
B [j] = m [I];
J ++;
}

System. out. print ("\ n move" + n + "The following array is :");
For (int r: B ){
System. out. print (r + "");
}
} Else {
System. out. print ("\ n moving error! ");
}
}
}