Lua用一维数组存储一个n阶方阵,输出这个方阵的正对角线上的数的
发布时间:2020-12-14 21:50:55 所属栏目:大数据 来源:网络整理
导读:arr = { 11 , 2 , 4 , 4 , 5 , 6 , 10 , 8 ,- 12 } function diagonalDifference(arr)dimesion = math.sqrt (# arr) arr1 = {} sum1 = 0 arr2 = {} sum2 = 0 for i= 1 ,dimesion do for j= 1 ,dimesion do if (i == j) then arr1[j] = arr[ 1 + (j - 1 ) * (
arr = {11,2,4,4,5,6,10,8,-12} function diagonalDifference(arr) dimesion = math.sqrt(#arr) arr1 = {} sum1 = 0 arr2 = {} sum2 = 0 for i=1,dimesion do for j=1,dimesion do if(i == j)then arr1[j] = arr[1 + (j - 1) * (dimesion + 1)] sum1 = sum1 + arr1[j] --print(arr1[j]) end end end for i=1,dimesion do if((i + j) == (dimesion + 1))then arr1[j] = arr[dimesion + (j - 1) * (dimesion - 1)] sum2 = sum2 + arr1[j] --print(arr1[j]) end end end return math.abs(sum2 - sum1) end print(diagonalDifference(arr)) (编辑:李大同) 【声明】本站内容均来自网络,其相关言论仅代表作者个人观点,不代表本站立场。若无意侵犯到您的权利,请及时与联系站长删除相关内容! |