Commit e1987c4

committed

feat: add python and java solutions to leetcode problem: No.0766

1 parent 0bb9216 commit e1987c4Copy full SHA for e1987c4

File tree

+65

-4

lines changed

+65

-4

lines changed

Lines changed: 23 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -55,22 +55,43 @@ matrix = [`
`55`	`55`
`56`	`56`	`<!-- 这里可写通用的实现逻辑 -->`
`57`	`57`
	`58`	+遍历矩阵,若出现元素与其左上角的元素不等的情况,返回 `false`。
	`59`	`+`
`58`	`60`	`<!-- tabs:start -->`
`59`	`61`
`60`	`62`	`### Python3`
`61`	`63`
`62`	`64`	`<!-- 这里可写当前语言的特殊实现逻辑 -->`
`63`	`65`
`64`	`66`	```python
`65`		`-`
	`67`	`+class Solution:`
	`68`	`+ def isToeplitzMatrix(self, matrix: List[List[int]]) -> bool:`
	`69`	`+ m, n = len(matrix), len(matrix[0])`
	`70`	`+ for i in range(1, m):`
	`71`	`+ for j in range(1, n):`
	`72`	`+ if matrix[i][j] != matrix[i - 1][j - 1]:`
	`73`	`+ return False`
	`74`	`+ return True`
`66`	`75`	```
`67`	`76`
`68`	`77`	`### Java`
`69`	`78`
`70`	`79`	`<!-- 这里可写当前语言的特殊实现逻辑 -->`
`71`	`80`
`72`	`81`	```java
`73`		`-`
	`82`	`+class Solution {`
	`83`	`+ public boolean isToeplitzMatrix(int[][] matrix) {`
	`84`	`+ int m = matrix.length, n = matrix[0].length;`
	`85`	`+ for (int i = 1; i < m; ++i) {`
	`86`	`+ for (int j = 1; j < n; ++j) {`
	`87`	`+ if (matrix[i][j] != matrix[i - 1][j - 1]) {`
	`88`	`+ return false;`
	`89`	`+ }`
	`90`	`+ }`
	`91`	`+ }`
	`92`	`+ return true;`
	`93`	`+ }`
	`94`	`+}`
`74`	`95`	```
`75`	`96`
`76`	`97`	`### ...`

Lines changed: 21 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -86,13 +86,32 @@ The diagonal "[1, 2]" has different elements.`
`86`	`86`	`### Python3`
`87`	`87`
`88`	`88`	```python
`89`		`-`
	`89`	`+class Solution:`
	`90`	`+ def isToeplitzMatrix(self, matrix: List[List[int]]) -> bool:`
	`91`	`+ m, n = len(matrix), len(matrix[0])`
	`92`	`+ for i in range(1, m):`
	`93`	`+ for j in range(1, n):`
	`94`	`+ if matrix[i][j] != matrix[i - 1][j - 1]:`
	`95`	`+ return False`
	`96`	`+ return True`
`90`	`97`	```
`91`	`98`
`92`	`99`	`### Java`
`93`	`100`
`94`	`101`	```java
`95`		`-`
	`102`	`+class Solution {`
	`103`	`+ public boolean isToeplitzMatrix(int[][] matrix) {`
	`104`	`+ int m = matrix.length, n = matrix[0].length;`
	`105`	`+ for (int i = 1; i < m; ++i) {`
	`106`	`+ for (int j = 1; j < n; ++j) {`
	`107`	`+ if (matrix[i][j] != matrix[i - 1][j - 1]) {`
	`108`	`+ return false;`
	`109`	`+ }`
	`110`	`+ }`
	`111`	`+ }`
	`112`	`+ return true;`
	`113`	`+ }`
	`114`	`+}`
`96`	`115`	```
`97`	`116`
`98`	`117`	`### ...`

Lines changed: 13 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,13 @@`
	`1`	`+class Solution {`
	`2`	`+ public boolean isToeplitzMatrix(int[][] matrix) {`
	`3`	`+ int m = matrix.length, n = matrix[0].length;`
	`4`	`+ for (int i = 1; i < m; ++i) {`
	`5`	`+ for (int j = 1; j < n; ++j) {`
	`6`	`+ if (matrix[i][j] != matrix[i - 1][j - 1]) {`
	`7`	`+ return false;`
	`8`	`+ }`
	`9`	`+ }`
	`10`	`+ }`
	`11`	`+ return true;`
	`12`	`+ }`
	`13`	`+}`

Lines changed: 8 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,8 @@`
	`1`	`+class Solution:`
	`2`	`+ def isToeplitzMatrix(self, matrix: List[List[int]]) -> bool:`
	`3`	`+ m, n = len(matrix), len(matrix[0])`
	`4`	`+ for i in range(1, m):`
	`5`	`+ for j in range(1, n):`
	`6`	`+ if matrix[i][j] != matrix[i - 1][j - 1]:`
	`7`	`+ return False`
	`8`	`+ return True`

Comments

(0)