java经典编程题二及详细答案(8)

max = a[0][0];

for(i=0; i

for(j=0; j max){ max = a[i][j]; maxI = i; maxJ = j; } } }

System.out.println(\数组的最大值：\

System.out.println(\位置：(\ reverse(a, b);

System.out.println(\转置矩阵：\ for(i=0; i

for(j=0; j

System.out.print(b[i][j] \ \ }

System.out.println(); } }

public static void reverse(int[][]a, int[][] b){ for(int i=0; i

for(int j=0; j

结果截图：

5）程序如下： public class yanghui

{public static void main(String args[]) {

final int ROW=7;

int a[][]=new int[ROW 1][]; for(int i=0;i<=ROW;i )

{ a[i]=new int[i 1]; //指定每行的列数 } yanghui(a,ROW); }

static void yanghui(int a[][],int ROW) {

for(int i=0;i<=ROW;i )

for(int j=0;j<=a[i].length-1;j ) {

if(i==0||j==0||j==a[i].length-1) a[i][j]=1;

else a[i][j]=a[i-1][j-1] a[i-1][j]; }

for(int i=0;i<=ROW;i ) {

for(int j=0;j<=a[i].length-1;j ) System.out.print(a[i][j] \ System.out.println();

} } }

结果截图：

? 提高题

1）程序如下：

import java.util.Random; public class qushupaixu {

public static void main(String[] args) {

Random r=new Random(); int items=0;

int[] arrs=new int[20]; while(items<20) {

int number=r.nextInt(50);//生成0-50之间的随机数

if(!findKey(arrs,number))//判断有没有重复的值，没有的话添加进数组 { arrs[items ]=number;} }

sort(arrs);

for (int i = 0; i < arrs.length; i ) {System.out.print( arrs[i] \ \ System.out.println(\ avg(arrs); }

//判断有没有重复的值的方法

public static boolean findKey(int[] arrs,int num)

{

for(int i=0;i

if(arrs[i]==num) {return true;} }

return false; }

public static void sort(int[] arrs) { for(int i=0;i

for(int j=i;jarrs[j]) { index = j; } }

swap(arrs,i, index); } }

public static void swap(int[] arrs, int i, int j) { int tmp = arrs[i]; arrs[i] = arrs[j]; arrs[j] = tmp; }

public static void avg(int[] arrs) {

int sum=0; int avg=0;

for (int i = 0; i < arrs.length; i ) { sum =arrs[i];} avg=sum/arrs.length;

System.out.println(\本次产生的随机数组的平均值为：\ } }

结果截图：

2）程序如下：

import java.util.Random; public class andian {

public static void main(String[] args){ int a[][] = new int[6][6]; for(int i = 0;i<6;i ){ for(int j = 0;j<6;j ){

a[i][j]=new Random().nextInt(10); System.out.print(a[i][j] \ \ }

System.out.println(); }

int max = 0; int min = 100; int flag = 0; int flag2 = 0; for(int i=0;i<6;i ){ for(int j=0;j<6;j ){ if(a[i][j]>max){ max=a[i][j]; flag = j; } }

for(int k=0;k<6;k ){ if(a[k][flag]

if(flag2 == i) {

System.out.println(\是鞍点\ System.out.println(\该元素是:\