Commit f8733e8

committed

update

1 parent a0f9135 commit f8733e8Copy full SHA for f8733e8

File tree

-7

lines changed

-7

lines changed

Lines changed: 3 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -6,13 +6,13 @@`
`6`	`6`	`*/`
`7`	`7`
`8`	`8`	`#include <stdbool.h>`
`9`		`-#include "c/test.h"`
`10`	`9`	`#include "c/data-structures/array.h"`
	`10`	`+#include "c/test.h"`
`11`	`11`
`12`	`12`	`bool canJump(int *nums, int numsSize) {`
`13`	`13`	`int flag = 0;`
`14`		`- for (int i = numsSize-2; i >= 0; i--) {`
`15`		`- flag = nums[i] <= flag ? flag+1 : 0;`
	`14`	`+ for (int i = numsSize-2; i >= 0; i--) {`
	`15`	`+ flag = nums[i] <= flag ? flag+1 : 0;`
`16`	`16`	`}`
`17`	`17`
`18`	`18`	`return flag == 0;`

Lines changed: 4 additions & 4 deletions

Original file line number	Diff line number	Diff line change
`@@ -11,10 +11,10 @@`
`11`	`11`
`12`	`12`	`#define MIN(a, b) ((a) <= (b) ? (a) : (b))`
`13`	`13`	`#define MAX(a, b) ((a) >= (b) ? (a) : (b))`
`14`		`-int maximalSquare(char **matrix, int matrixRowSize, int matrixColSize) {`
	`14`	`+int maximalSquare(char *matrix, int matrixSize, int matrixColSize) {`
`15`	`15`	`int rtn = '0';`
`16`		`- for (int i = 0; i < matrixRowSize; ++i) {`
`17`		`- for (int j = 0; j < matrixColSize; ++j) {`
	`16`	`+ for (int i = 0; i < matrixSize; ++i) {`
	`17`	`+ for (int j = 0; j < matrixColSize[0]; ++j) {`
`18`	`18`	`if (matrix[i][j] != '0') {`
`19`	`19`	`if (i > 0 && j > 0)`
`20`	`20`	`matrix[i][j] = MIN(MIN(matrix[i-1][j], matrix[i][j-1]), matrix[i-1][j-1]) + 1;`
`@@ -30,7 +30,7 @@ int maximalSquare(char **matrix, int matrixRowSize, int matrixColSize) {`
`30`	`30`	`void test(int expect, const char *str) {`
`31`	`31`	`arrayEntry *e = arrayParse2D(str, ARRAY_CHAR);`
`32`	`32`
`33`		`- EXPECT_EQ_INT(expect, maximalSquare(arrayValue(e), arrayRow(e), arrayCol(e)));`
	`33`	`+ EXPECT_EQ_INT(expect, maximalSquare(arrayValue(e), arrayRow(e), arrayCols(e)));`
`34`	`34`
`35`	`35`	`arrayFree(e);`
`36`	`36`	`}`

Comments

(0)