- public static void Akm() {
- int [] array = new int [] {1,3,-1,5,-2};
- int [] array2 = new int [5];
- System.out.println("原数组为:");
- for (int i = 0; i < array.length; i++) {
- System.out.print(array[i]+" ");
- }
- for (int i = array.length-1 ,j = 0; i >=0 ; i--,j++) {
- if (! (array[i]<0)) {
- array2[j] = array[i];
- }else {
- }
- }
- System.out.println("\n逆序处理后的数组为:");
- for (int i = 0; i < array2.length; i++) {
- System.out.print(array2[i]+" ");
- }
- }
第七章4
猜你喜欢
转载自blog.csdn.net/qq3144836446/article/details/80225665
今日推荐
周排行