Skip to content

Commit d1baefd

Browse files
authored
feat: add ts solution to lc problem: No.1572 (doocs#1426)
1 parent 9ae4293 commit d1baefd

File tree

2 files changed

+24
-0
lines changed

2 files changed

+24
-0
lines changed

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

+12
Original file line numberDiff line numberDiff line change
@@ -133,6 +133,18 @@ func diagonalSum(mat [][]int) (ans int) {
133133

134134
### **TypeScript**
135135

136+
```ts
137+
function diagonalSum(mat: number[][]): number {
138+
let ans = 0;
139+
const n = mat.length;
140+
for (let i = 0; i < n; ++i) {
141+
const j = n - i - 1;
142+
ans += mat[i][i] + (i === j ? 0 : mat[i][j]);
143+
}
144+
return ans;
145+
}
146+
```
147+
136148
```ts
137149
function diagonalSum(mat: number[][]): number {
138150
const n = mat.length;

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

+12
Original file line numberDiff line numberDiff line change
@@ -113,6 +113,18 @@ func diagonalSum(mat [][]int) (ans int) {
113113

114114
### **TypeScript**
115115

116+
```ts
117+
function diagonalSum(mat: number[][]): number {
118+
let ans = 0;
119+
const n = mat.length;
120+
for (let i = 0; i < n; ++i) {
121+
const j = n - i - 1;
122+
ans += mat[i][i] + (i === j ? 0 : mat[i][j]);
123+
}
124+
return ans;
125+
}
126+
```
127+
116128
```ts
117129
function diagonalSum(mat: number[][]): number {
118130
const n = mat.length;

0 commit comments

Comments
 (0)