funccountNegatives(grid [][]int)int{
ans :=0for i:=0;i<len(grid);i++{for j:=0;j<len(grid[0]);j++{if grid[i][j]<0{
ans++}}}return ans
}
矩阵对角线元素的和
funcdiagonalSum(mat [][]int)int{
i, j :=0,0
ans, tmp :=0,0for i <len(mat)&& j <len(mat){if j ==len(mat)/2&& i ==len(mat)/2{
tmp = mat[i][j]}
ans += mat[i][j]
i++
j++}
i, j =len(mat)-1,0for i >=0&& j <len(mat){if j ==len(mat)/2&& i ==len(mat)/2{
tmp = mat[i][j]}
ans += mat[i][j]
i--
j++}iflen(mat)%2==0{return ans
}return ans-tmp
}
最富有客户的资产总量
funcmaximumWealth(accounts [][]int)int{
dp :=make([][]int,len(accounts))for i:=0;i<len(accounts);i++{
dp[i]=make([]int,len(accounts[i]))
dp[i][0]= accounts[i][0]}
ans :=-1for i:=0;i<len(accounts);i++{for j:=1;j<len(accounts[i]);j++{
dp[i][j]= dp[i][j-1]+ accounts[i][j]// fmt.Printf("i=%d, j=%d, ,dp[%d][%d]=%d ,dp[%d][%d]=%d\n", i, j, i, j-1, i, j, dp[i][j-1], dp[i][j])}
ans =max(ans, dp[i][len(accounts[i])-1])}return ans
}funcmax(x, y int)int{if x < y {return y
}return x
}
func luckyNumbers (matrix [][]int)[]int{//查找列中最大数
colMax :=make([]int,len(matrix[0]))
res :=make([]int,0)
rowMin :=make([]int,len(matrix))var ans intfor i:=0;i<len(matrix[0]);i++{
ans =-1for j:=0;j<len(matrix);j++{
ans =max(ans, matrix[j][i])}
colMax[i]= ans
}// fmt.Println(colMax)for i:=0;i<len(matrix);i++{
ans =10e9for j:=0;j<len(matrix[0]);j++{
ans =min(ans, matrix[i][j])}
rowMin[i]= ans
}//fmt.Println(rowMin)for i:=0;i<len(matrix);i++{for j:=0;j<len(matrix[0]);j++{if matrix[i][j]== rowMin[i]&& matrix[i][j]== colMax[j]{
res =append(res, matrix[i][j])}}}return res
}funcmax(x, y int)int{if x < y {return y
}return x
}funcmin(x, y int)int{if x < y {return x
}return y
}
统计有序矩阵中的负数func countNegatives(grid [][]int) int { ans := 0 for i:=0;i<len(grid);i++ { for j:=0;j<len(grid[0]);j++ { if grid[i][j] < 0 { ans++ } } } return ans}矩阵对角线元素的和fu