-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathoffer-34-PathInTree.c
86 lines (77 loc) · 2.04 KB
/
offer-34-PathInTree.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
#include <stdio.h>
#include <stdlib.h>
#include "minunit.h"
// https://leetcode-cn.com/problems/er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof/
#define MAX_SIZE 100
/**
* Definition for a binary tree node.
*/
struct TreeNode
{
int val;
struct TreeNode *left;
struct TreeNode *right;
};
void dfs(struct TreeNode *root, int target, int *returnSize, int **returnColumnSizes, int **output, int *nums, int numSize)
{
if (root->left == NULL && root->right == NULL)
{
if (target - root->val == 0)
{
// copy cur path
nums[numSize++] = root->val;
int *path = (int *)malloc(sizeof(int) * (numSize + 1));
memcpy(path, nums, sizeof(int) * numSize);
(*returnColumnSizes)[*returnSize] = numSize;
output[(*returnSize)++] = path;
}
}
else
{
nums[numSize++] = root->val;
int *path = (int *)malloc(sizeof(int) * (numSize + 1));
memcpy(path, nums, sizeof(int) * numSize);
if (root->left != NULL)
{
dfs(root->left, target - root->val, returnSize, returnColumnSizes, output, path, numSize);
}
if (root->right != NULL)
{
dfs(root->right, target - root->val, returnSize, returnColumnSizes, output, path, numSize);
}
}
}
/**
* Return an array of arrays of size *returnSize.
* The sizes of the arrays are returned as *returnColumnSizes array.
* Note: Both returned array and *columnSizes array must be malloced, assume caller calls free().
*/
int **pathSum(struct TreeNode *root, int sum, int *returnSize, int **returnColumnSizes)
{
if (root == NULL)
{
*returnSize = 0;
**returnColumnSizes = 0;
return NULL;
}
int **output = (int **)malloc(sizeof(int *) * MAX_SIZE);
*returnColumnSizes = (int *)malloc(sizeof(int) * MAX_SIZE);
int *nums = (int *)malloc(sizeof(int) * 2);
*returnSize = 0;
dfs(root, sum, returnSize, returnColumnSizes, output, nums, 0);
return output;
}
MU_TEST(test_case)
{
mu_check(5 == 7);
}
MU_TEST_SUITE(test_suite)
{
MU_RUN_TEST(test_case);
}
int main()
{
MU_RUN_SUITE(test_suite);
MU_REPORT();
return MU_EXIT_CODE;
}