Leetcode.1572 矩阵对角线元素的和

一、将加过的元素置为0

将加过的元素置为0，这样就不会重复相加，代码实现如下：

class Solution {
public:
    int diagonalSum(vector<vector<int>>& mat) {
        int n = mat.size();
        int res = 0;
        for (int i = 0; i < n; ++i) {
            res += mat[i][i];
            mat[i][i] = 0;
        }
        for (int i = n - 1; i >= 0; --i) {
            res += mat[i][n - 1 - i];
        }
        return res;
    }
};

二、优化一下

降低运行时间，也没有改变原有的值

class Solution {
public:
    int diagonalSum(vector<vector<int>>& mat) {
        int n = mat.size();
        int res = 0;
        for (int i = 0; i < n; ++i) {
            if (i == n - 1 - i) {
                res += mat[i][i];
                continue;
            }
            res += mat[i][i] + mat[n - 1 -i][i];
            mat[i][i] = 0;
        }
        return res;
    }
};