javaLearn---数组逆序重放

豆沙沙包?

于 2020-12-20 20:57:28 发布

阅读量459

点赞数 1

分类专栏： java

原文链接：https://blog.csdn.net/qq_22222499/article/details/51960324

版权

java 专栏收录该内容

103 篇文章 2 订阅

订阅专栏

1：在这里插入图片描述 2.代码实现
逆序抓住a[n-1-j]

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int[] a = new int[n];
		for (int i = 0; i < n; i++) {
			a[i] = sc.nextInt();
		}
		for (int j = 0; j < n; j++)

		{
			System.out.print(a[n - 1 - j] + " ");
		}
	}
}

法二：

import java.util.Scanner;


public class Main{

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int[] a = new int[n];
		for (int i = 0; i <n; i++) {
			a[i] = sc.nextInt();
		}
		for(int i=a.length-1;i>=0;i--)
		{System.out.print(a[i]+" ");
	   //数组的长度 b.length
		//字符串的长度b.length()　
		}
	}

}