// 数组里相邻两个数做比较 取满足条件的那个(以此类推) var arr = [1,3,4,5,6,7]; function Max(array){ var max = array[0]; for(var i=0; i<array.length; i++){ if(max<array[i]) max = array[i]; } return max; } console.log(Max(arr)); function Min(array){ var min = array[0]; for(v…
1.输出M行M列数组方针,求对角线元素和#define M 5void fun(int xx[][M], int n)//n行n列{ int i = 0; int sum = 0; for (i = 0; i < n; i++) { int j = 0; for (j = 0; j < n; j++) { printf("%d\t", xx[i][j]);//先把矩阵打印出来 } printf("\n"); } printf("\n"…