Commit 4fab7e0

committed

Improvement

Signed-off-by: begeekmyfriend <begeekmyfriend@gmail.com>

1 parent ea7312c commit 4fab7e0Copy full SHA for 4fab7e0

File tree

+20

-15

lines changed

+20

-15

lines changed

Lines changed: 8 additions & 4 deletions

Original file line number	Diff line number	Diff line change
`@@ -43,7 +43,7 @@ int** threeSum(int* nums, int numsSize, int* returnSize, int** returnColumnSizes`
`43`	`43`	`int i, j, capacity = 50000;`
`44`	`44`	`int *results = malloc(capacity sizeof(int *));`
`45`	`45`	`for (i = 0; i < numsSize - 2; i++) {`
`46`		`- if (i == 0 \|\| i > 0 && nums[i] != nums[i - 1]) {`
	`46`	`+ if (i == 0 \|\| (i > 0 && nums[i] != nums[i - 1])) {`
`47`	`47`	`two_sum(nums, i + 1, numsSize - 1, -nums[i], results, returnSize);`
`48`	`48`	`}`
`49`	`49`	`}`
`@@ -58,14 +58,18 @@ int** threeSum(int* nums, int numsSize, int* returnSize, int** returnColumnSizes`
`58`	`58`
`59`	`59`	`int main(void)`
`60`	`60`	`{`
`61`		`- int i, count;`
	`61`	`+ int i, j, count;`
`62`	`62`	`//int nums[] = { -1, 0, 1, 2, -1, -4 };`
`63`	`63`	`//int nums[] = { 0, 0, 0 };`
`64`	`64`	`//int nums[] = { -1, 0, 1, 0 };`
`65`	`65`	`int nums[] = {-2,0,0,2,2};`
`66`		`- int *triplets = threeSum(nums, sizeof(nums) / sizeof(nums), &count);`
	`66`	`+ int *col_sizes;`
	`67`	`+ int *triplets = threeSum(nums, sizeof(nums) / sizeof(nums), &count, &col_sizes);`
`67`	`68`	`for (i = 0; i < count; i++) {`
`68`		`- printf("%d %d %d\n", triplets[i][0], triplets[i][1], triplets[i][2]);`
	`69`	`+ for (j = 0; j < col_sizes[i]; j++) {`
	`70`	`+ printf("%d \n", triplets[i][j]);`
	`71`	`+ }`
	`72`	`+ printf("\n");`
`69`	`73`	`}`
`70`	`74`
`71`	`75`	`return 0;`

Lines changed: 5 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -68,13 +68,16 @@ int** fourSum(int* nums, int numsSize, int target, int* returnSize, int** return`
`68`	`68`
`69`	`69`	`int main(void)`
`70`	`70`	`{`
`71`		`- int i, count, target = 11, *col_sizes;`
	`71`	`+ int i, j, count, target = 11, *col_sizes;`
`72`	`72`	`//int nums[] = { 1, 0, -1, 0, -2, 2 };`
`73`	`73`	`//int nums[] = { -3, -2, -1, 0, 0, 1, 2, 3 };`
`74`	`74`	`int nums[] = { 0, 1, 5, 0, 1, 5, 5, -4 };`
`75`	`75`	`int *quadruplets = fourSum(nums, sizeof(nums) / sizeof(nums), target, &count, &col_sizes);`
`76`	`76`	`for (i = 0; i < count; i++) {`
`77`		`- printf("%d %d %d %d\n", quadruplets[i][0], quadruplets[i][1], quadruplets[i][2], quadruplets[i][3]);`
	`77`	`+ for (j = 0; j < col_sizes[i]; j++) {`
	`78`	`+ printf("%d ", quadruplets[i][j]);`
	`79`	`+ }`
	`80`	`+ printf("\n");`
`78`	`81`	`}`
`79`	`82`
`80`	`83`	`return 0;`

Lines changed: 3 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -88,10 +88,10 @@ int main(int argc, char **argv)`
`88`	`88`	`nums[i] = atoi(argv[i + 1]);`
`89`	`89`	`}`
`90`	`90`
`91`		`- int *size;`
`92`		`- int **lists = permute(nums, argc - 1, &count, &size);`
	`91`	`+ int *col_sizes;`
	`92`	`+ int **lists = permute(nums, argc - 1, &count, &col_sizes);`
`93`	`93`	`for (i = 0; i < count; i++) {`
`94`		`- for (j = 0; j < argc-1; j++) {`
	`94`	`+ for (j = 0; j < col_sizes[i]; j++) {`
`95`	`95`	`printf("%d", lists[i][j]);`
`96`	`96`	`}`
`97`	`97`	`putchar('\n');`

Lines changed: 3 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -72,10 +72,10 @@ int main(int argc, char **argv)`
`72`	`72`	`nums[i] = atoi(argv[i + 1]);`
`73`	`73`	`}`
`74`	`74`
`75`		`- int *size;`
`76`		`- int **lists = permute(nums, argc - 1, &count, &size);`
	`75`	`+ int *col_sizes;`
	`76`	`+ int **lists = permute(nums, argc - 1, &count, &col_sizes);`
`77`	`77`	`for (i = 0; i < count; i++) {`
`78`		`- for (j = 0; j < argc-1; j++) {`
	`78`	`+ for (j = 0; j < col_sizes[i]; j++) {`
`79`	`79`	`printf("%d", lists[i][j]);`
`80`	`80`	`}`
`81`	`81`	`putchar('\n');`

Lines changed: 1 addition & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -90,9 +90,7 @@ static void node_free(struct queue_node qn, struct list_head free_list)`
`90`	`90`	`}`
`91`	`91`
`92`	`92`	`/**`
`93`		`- ** Return an array of arrays of size *returnSize.`
`94`		`- ** The sizes of the arrays are returned as *returnColumnSizes array.`
`95`		`- ** Note: Both returned array and *returnColumnSizes array must be malloced, assume caller calls free().`
	`93`	`+ ** The returned array must be malloced, assume caller calls free().`
`96`	`94`	`**/`
`97`	`95`	`static int* rightSideView(struct TreeNode* root, int* returnSize)`
`98`	`96`	`{`

Comments

(0)