feat: add solutions to lc problem: No.1572. Matrix Diagonal Sum

Author: yanglbme

Diff for: solution/1500-1599/1572.Matrix Diagonal Sum/README.md

@@ -64,15 +64,61 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def diagonalSum(self, mat: List[List[int]]) -> int:
+        n = len(mat)
+        res = 0
+        for i in range(n):
+            res += mat[i][i] + (0 if n - i - 1 == i else mat[i][n - i - 1])
+        return res
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+class Solution {
+    public int diagonalSum(int[][] mat) {
+        int n = mat.length;
+        int res = 0;
+        for (int i = 0; i < n; ++i) {
+            res += mat[i][i] + (n - i - 1 == i ? 0 : mat[i][n - i - 1]);
+        }
+        return res;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+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] + (n - i - 1 == i ? 0 : mat[i][n - i - 1]);
+        }
+        return res;
+    }
+};
+```
 
+### **Go**
+
+```go
+func diagonalSum(mat [][]int) int {
+	n, res := len(mat), 0
+	for i := 0; i < n; i++ {
+		res += mat[i][i]
+		if n-i-1 != i {
+			res += mat[i][n-i-1]
+		}
+	}
+	return res
+}
 ```
 
 ### **...**

Diff for: solution/1500-1599/1572.Matrix Diagonal Sum/README_EN.md

@@ -54,13 +54,59 @@ Notice that element mat[1][1] = 5 is counted only once.
 ### **Python3**
 
 ```python
-
+class Solution:
+    def diagonalSum(self, mat: List[List[int]]) -> int:
+        n = len(mat)
+        res = 0
+        for i in range(n):
+            res += mat[i][i] + (0 if n - i - 1 == i else mat[i][n - i - 1])
+        return res
 ```
 
 ### **Java**
 
 ```java
+class Solution {
+    public int diagonalSum(int[][] mat) {
+        int n = mat.length;
+        int res = 0;
+        for (int i = 0; i < n; ++i) {
+            res += mat[i][i] + (n - i - 1 == i ? 0 : mat[i][n - i - 1]);
+        }
+        return res;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+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] + (n - i - 1 == i ? 0 : mat[i][n - i - 1]);
+        }
+        return res;
+    }
+};
+```
 
+### **Go**
+
+```go
+func diagonalSum(mat [][]int) int {
+	n, res := len(mat), 0
+	for i := 0; i < n; i++ {
+		res += mat[i][i]
+		if n-i-1 != i {
+			res += mat[i][n-i-1]
+		}
+	}
+	return res
+}
 ```
 
 ### **...**

Diff for: solution/1500-1599/1572.Matrix Diagonal Sum/Solution.cpp

@@ -0,0 +1,11 @@
+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] + (n - i - 1 == i ? 0 : mat[i][n - i - 1]);
+        }
+        return res;
+    }
+};

Diff for: solution/1500-1599/1572.Matrix Diagonal Sum/Solution.go

@@ -0,0 +1,10 @@
+func diagonalSum(mat [][]int) int {
+	n, res := len(mat), 0
+	for i := 0; i < n; i++ {
+		res += mat[i][i]
+		if n-i-1 != i {
+			res += mat[i][n-i-1]
+		}
+	}
+	return res
+}

Diff for: solution/1500-1599/1572.Matrix Diagonal Sum/Solution.java

@@ -1,9 +1,10 @@
 class Solution {
     public int diagonalSum(int[][] mat) {
-        int sum = 0, n = mat.length, mid = n >> 1;
-        for (int i = 0, j = n - 1; i < n; i++, j--) {
-            sum += (mat[i][i] + mat[i][j]);
+        int n = mat.length;
+        int res = 0;
+        for (int i = 0; i < n; ++i) {
+            res += mat[i][i] + (n - i - 1 == i ? 0 : mat[i][n - i - 1]);
         }
-        return n % 2 == 0 ? sum : sum - mat[mid][mid];
+        return res;
     }
 }

Diff for: solution/1500-1599/1572.Matrix Diagonal Sum/Solution.py

@@ -0,0 +1,7 @@
+class Solution:
+    def diagonalSum(self, mat: List[List[int]]) -> int:
+        n = len(mat)
+        res = 0
+        for i in range(n):
+            res += mat[i][i] + (0 if n - i - 1 == i else mat[i][n - i - 1])
+        return res