java solution Beats 100.00%
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n    public int diagonalSum(int[][] mat) {\n        int n = mat.length;\n        if(n == 1) return mat[0][0];\n        int sum = 0;\n        int j = 0;\n        for(int i = 0;i<n;i++){\n            if((n & 1) == 1){\n             if(j == n/2){\n                 sum+=mat[i][j];\n             }else{\n                 sum+=mat[i][j] + mat[i][n-j-1];\n             }\n            }else{\n           sum+=mat[i][j] + mat[i][n-j-1];\n\n            } \n           j++;\n            \n        }\n        return sum;\n    }\n}\n```
['Java']