cantyonion/leetcode
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

2711

Browse Source
This commit is contained in:
Jeffrey Hsu
2025-03-25 18:02:30 +08:00
parent c4ad87ecea
commit e0f249d1d9
1 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
src/2711.c
View File

@@ -13,7 +13,7 @@ int differentElementNum(int *elem, int size)
bool flag = true; bool flag = true;
// check same elem // check same elem
for (int j = 0; j < sum; j++) for (int j = 0; j < sum; j++)
if (elem[i] == elem[j]) if (elem[i] == temp[j])
flag = false; flag = false;
// if not in temp, add to temp // if not in temp, add to temp
if (flag) if (flag)
@@ -35,9 +35,11 @@ int differentElementNum(int *elem, int size)
int **differenceOfDistinctValues(int **grid, int gridSize, int *gridColSize, int *returnSize, int **returnColumnSizes) int **differenceOfDistinctValues(int **grid, int gridSize, int *gridColSize, int *returnSize, int **returnColumnSizes)
{ {
int **answer = (int **)malloc(sizeof(int *) * gridSize); int **answer = (int **)malloc(sizeof(int *) * gridSize);
*returnColumnSizes = (int *)malloc(gridSize * sizeof(int));
for (int r = 0; r < gridSize; r++) for (int r = 0; r < gridSize; r++)
{ {
answer[r] = (int *)malloc(sizeof(int) * gridColSize[r]); answer[r] = (int *)malloc(sizeof(int) * gridColSize[r]);
(*returnColumnSizes)[r] = gridColSize[r];
for (int c = 0; c < gridColSize[r]; c++) for (int c = 0; c < gridColSize[r]; c++)
{ {
// calc topLeft array // calc topLeft array
@@ -70,7 +72,5 @@ int **differenceOfDistinctValues(int **grid, int gridSize, int *gridColSize, int
} }
*returnSize = gridSize; *returnSize = gridSize;
*returnColumnSizes = gridColSize;
return answer; return answer;
} }