Commitcba27f1

committed

edit 498

1 parent633abea commitcba27f1Copy full SHA for cba27f1

File tree

-120

lines changed

-120

lines changed

Lines changed: 0 additions & 81 deletions

This file was deleted.

Lines changed: 3 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -3,7 +3,8 @@`
`3`	`3`	`/**`
`4`	`4`	`* 498. Diagonal Traverse`
`5`	`5`	`*`
`6`		`- * Given a matrix of M x N elements (M rows, N columns), return all elements of the matrix in diagonal order as shown in the below image.`
	`6`	`+ * Given a matrix of M x N elements (M rows, N columns), return all elements of the matrix in diagonal order`
	`7`	`+ * as shown in the below image.`
`7`	`8`
`8`	`9`	`Example:`
`9`	`10`
`@@ -22,7 +23,7 @@`
`22`	`23`	`*/`
`23`	`24`	`publicclass_498 {`
`24`	`25`
`25`		`-/**Credit: https://discuss.leetcode.com/topic/77865/concise-java-solution/2`
	`26`	`+/**Reference: https://discuss.leetcode.com/topic/77865/concise-java-solution/2`
`26`	`27`	`* Just keep walking the matrix, when hitting the four borders (top, bottom, left or right),`
`27`	`28`	`* just directions and keep walking.*/`
`28`	`29`	`publicint[]findDiagonalOrder(int[][]matrix) {`

Lines changed: 0 additions & 37 deletions

This file was deleted.

Comments

(0)