Commit c45b7e4

committed

feat: update solutions to leetcode problem: No.0054

1 parent 6ae0a1b commit c45b7e4Copy full SHA for c45b7e4

File tree

+19

-15

lines changed

+19

-15

lines changed

Lines changed: 8 additions & 5 deletions

Original file line number	Diff line number	Diff line change
`@@ -29,6 +29,13 @@`
`29`	`29`	`<strong>输出:</strong> [1,2,3,4,8,12,11,10,9,5,6,7]`
`30`	`30`	`</pre>`
`31`	`31`
	`32`	`+提示:`
	`33`	`+`
	`34`	`+- m == matrix.length`
	`35`	`+- n == matrix[i].length`
	`36`	`+- 1 <= m, n <= 10`
	`37`	`+- -100 <= matrix[i][j] <= 100`
	`38`	`+`
`32`	`39`	`## 解法`
`33`	`40`
`34`	`41`	`<!-- 这里可写通用的实现逻辑 -->`
`@@ -50,8 +57,6 @@ class Solution:`
`50`	`57`	`if j1 == j2:`
`51`	`58`	`return [matrix[i][j1] for i in range(i1, i2 + 1)]`
`52`	`59`	`return [matrix[i1][j] for j in range(j1, j2)] + [matrix[i][j2] for i in range(i1, i2)] + [matrix[i2][j] for j in range(j2, j1, -1)] + [matrix[i][j1] for i in range(i2, i1, -1)]`
`53`		`- if not matrix or not matrix[0]:`
`54`		`- return []`
`55`	`60`	`m, n = len(matrix), len(matrix[0])`
`56`	`61`	`i1, j1, i2, j2 = 0, 0, m - 1, n - 1`
`57`	`62`	`res = []`
`@@ -70,9 +75,7 @@ class Solution {`
`70`	`75`	`private List<Integer> res;`
`71`	`76`
`72`	`77`	`public List<Integer> spiralOrder(int[][] matrix) {`
`73`		`- int m, n;`
`74`		`- if (matrix == null \|\| (m = matrix.length) == 0 \|\| matrix[0] == null \|\| (n = matrix[0].length) == 0)`
`75`		`- return Collections.emptyList();`
	`78`	`+ int m = matrix.length, n = matrix[0].length;`
`76`	`79`	`res = new ArrayList<>();`
`77`	`80`	`int i1 = 0, i2 = m - 1;`
`78`	`81`	`int j1 = 0, j2 = n - 1;`

Lines changed: 9 additions & 5 deletions

Original file line number	Diff line number	Diff line change
`@@ -46,6 +46,13 @@`
`46`	`46`
`47`	`47`	`</pre>`
`48`	`48`
	`49`	`+Constraints:`
	`50`	`+`
	`51`	`+- m == matrix.length`
	`52`	`+- n == matrix[i].length`
	`53`	`+- 1 <= m, n <= 10`
	`54`	`+- -100 <= matrix[i][j] <= 100`
	`55`	`+`
`49`	`56`	`## Solutions`
`50`	`57`
`51`	`58`	`<!-- tabs:start -->`
`@@ -61,8 +68,7 @@ class Solution:`
`61`	`68`	`if j1 == j2:`
`62`	`69`	`return [matrix[i][j1] for i in range(i1, i2 + 1)]`
`63`	`70`	`return [matrix[i1][j] for j in range(j1, j2)] + [matrix[i][j2] for i in range(i1, i2)] + [matrix[i2][j] for j in range(j2, j1, -1)] + [matrix[i][j1] for i in range(i2, i1, -1)]`
`64`		`- if not matrix or not matrix[0]:`
`65`		`- return []`
	`71`	`+`
`66`	`72`	`m, n = len(matrix), len(matrix[0])`
`67`	`73`	`i1, j1, i2, j2 = 0, 0, m - 1, n - 1`
`68`	`74`	`res = []`
`@@ -79,9 +85,7 @@ class Solution {`
`79`	`85`	`private List<Integer> res;`
`80`	`86`
`81`	`87`	`public List<Integer> spiralOrder(int[][] matrix) {`
`82`		`- int m, n;`
`83`		`- if (matrix == null \|\| (m = matrix.length) == 0 \|\| matrix[0] == null \|\| (n = matrix[0].length) == 0)`
`84`		`- return Collections.emptyList();`
	`88`	`+ int m = matrix.length, n = matrix[0].length;`
`85`	`89`	`res = new ArrayList<>();`
`86`	`90`	`int i1 = 0, i2 = m - 1;`
`87`	`91`	`int j1 = 0, j2 = n - 1;`

Lines changed: 1 addition & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -2,9 +2,7 @@ class Solution {`
`2`	`2`	`private List<Integer> res;`
`3`	`3`
`4`	`4`	`public List<Integer> spiralOrder(int[][] matrix) {`
`5`		`- int m, n;`
`6`		`- if (matrix == null \|\| (m = matrix.length) == 0 \|\| matrix[0] == null \|\| (n = matrix[0].length) == 0)`
`7`		`- return Collections.emptyList();`
	`5`	`+ int m = matrix.length, n = matrix[0].length;`
`8`	`6`	`res = new ArrayList<>();`
`9`	`7`	`int i1 = 0, i2 = m - 1;`
`10`	`8`	`int j1 = 0, j2 = n - 1;`

Lines changed: 1 addition & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -6,8 +6,7 @@ def add(i1, j1, i2, j2):`
`6`	`6`	`if j1 == j2:`
`7`	`7`	`return [matrix[i][j1] for i in range(i1, i2 + 1)]`
`8`	`8`	`return [matrix[i1][j] for j in range(j1, j2)] + [matrix[i][j2] for i in range(i1, i2)] + [matrix[i2][j] for j in range(j2, j1, -1)] + [matrix[i][j1] for i in range(i2, i1, -1)]`
`9`		`- if not matrix or not matrix[0]:`
`10`		`- return []`
	`9`	`+`
`11`	`10`	`m, n = len(matrix), len(matrix[0])`
`12`	`11`	`i1, j1, i2, j2 = 0, 0, m - 1, n - 1`
`13`	`12`	`res = []`

Comments

(0)