Matrix Diagonal Sum (LeetCode 1572): One Loop, One Center Check

Problem. Given a square matrix mat, return the sum of its primary diagonal and its secondary diagonal. If the size is odd, the center cell sits on both diagonals, so count it only once. The idea For r