本文目錄一覽：
JAVA編寫程序使用數組
public static void main(String[] args) {
int[] arr = new int[20];
//初始化
arr[0] = 1;
arr[1] = 1;
//遍歷計算
for (int i = 2; i 20; i++) {
arr[i] = arr[i – 1] + arr[i – 2];
}
//打印
for (int i = 1; i 21; i++) {
System.out.println(“Fibonacci “+i+” = “+arr[i-1]);
}
}
Java 程序編寫 數組
import java.util.Scanner;
public class Array {
public static void main(String[] args) {
Scanner stdIn = new Scanner(System.in);
int rows, cols; // 行數與列數
System.out.print(“Enter number of rows and columns”
+ ” for the matrix: “);
rows = stdIn.nextInt();
cols = stdIn.nextInt();
int[][] arrA = new int[rows][cols];
arrA = readArray(stdIn, rows, cols);
System.out.println(“the matrix:”);
printArray(arrA);
getMax(arrA);
getMin(arrA);
}
/*******************************************************/
/* 讀入矩陣數據 */
public static int[][] readArray(Scanner scan,
int numRows, int numCols) {
int[][] arr = new int[numRows][numCols];
System.out.println(“Enter values for ” + numRows + “x” + numCols + ” matrix:”);
for (int row = 0; row arr.length; row++) {
for (int col = 0; col arr[0].length; col++) {
arr[row][col] = scan.nextInt();
}
}
return arr;
}
/*******************************************************/
/* 打印矩陣 */
public static void printArray(int[][] arr) {
for (int row=0; rowarr.length; row++) {
for (int col=0; colarr[0].length; col++) {
System.out.printf(“%5d”, arr[row][col]);
}
System.out.println();
}
}
public static void getMax(int[][] arr) {
int max = arr[0][0];
for (int row=0; rowarr.length; row++) {
for (int col=0; colarr[0].length; col++) {
if(arr[row][col]max){
max = arr[row][col];
}
}
}
System.out.println(“最大值為：”+max);
for (int row=0; rowarr.length; row++) {
for (int col=0; colarr[0].length; col++) {
if(arr[row][col]==max)
System.out.println(“最大值坐標為：(“+(row+1)+”,”+(col+1)+”)”);
}
}
}
public static void getMin(int[][] arr) {
int min = arr[0][0];
for (int row=0; rowarr.length; row++) {
for (int col=0; colarr[0].length; col++) {
if(arr[row][col]min){
min = arr[row][col];
}
}
}
System.out.println(“最小值為：”+min);
for (int row=0; rowarr.length; row++) {
for (int col=0; colarr[0].length; col++) {
if(arr[row][col]==min)
System.out.println(“最小值坐標為：(“+(row+1)+”,”+(col+1)+”)”);
}
}
}
}
關於Java中數組的程序
public
static
void
main(String[]
args)
{
int[]
score
=
{
18,
25,
7,
36,
13,
2,
89,
63
};
int
min
=
score[0];
int
t=0;
for
(int
i
=
1;
i
score.length;
i++)
{
if
(score[i]
min)
{
min
=
score[i];
t=i;
}
}
System.out.println(“這組數中最少的積分數是:”
+
min);
System.out.println(“它在數組中的原始位置是:”
+
(t+1));
這麼寫
原創文章，作者：小藍，如若轉載，請註明出處：https://www.506064.com/zh-hant/n/160570.html
微信掃一掃 
支付寶掃一掃 