• 1572. Matrix Diagonal Sum


    Given a square matrix mat, return the sum of the matrix diagonals.

    Only include the sum of all the elements on the primary diagonal and all the elements on the secondary diagonal that are not part of the primary diagonal.

    Example 1:

    Input: mat = [[1,2,3],
                  [4,5,6],
                  [7,8,9]]
    Output: 25
    Explanation: Diagonals sum: 1 + 5 + 9 + 3 + 7 = 25
    Notice that element mat[1][1] = 5 is counted only once.
    

    Example 2:

    Input: mat = [[1,1,1,1],
                  [1,1,1,1],
                  [1,1,1,1],
                  [1,1,1,1]]
    Output: 8
    

    Example 3:

    Input: mat = [[5]]
    Output: 5
    

    Constraints:

    • n == mat.length == mat[i].length
    • 1 <= n <= 100
    • 1 <= mat[i][j] <= 100
    class Solution {
        public int diagonalSum(int[][] mat) {
            int res = 0;
            int n = mat.length;
            for(int i = 0; i < n; i++) {
                res += mat[i][i];
                res += mat[i][n - i - 1];
            }
            
            return res - (n % 2 == 0 ? 0 : mat[n / 2][n / 2]); 
        }
    }

    ez af

  • 相关阅读:
    Win10中的IIS10安装php manager和IIS URL Rewrite
    第十四周
    第十三周
    第十二周
    第十一周
    第十周
    第九周
    测试作业
    第八周
    第七周
  • 原文地址:https://www.cnblogs.com/wentiliangkaihua/p/13738831.html
Copyright © 2020-2023  润新知