OpenSoure_Repos/TheAlgorithms-C
1
0
Fork 0
mirror of https://github.moeyy.xyz/https://github.com/TheAlgorithms/C.git synced 2023-10-11 15:56:24 +08:00
Code Issues Packages Projects Releases Wiki Activity

feat: add Distribute Coins in Binary Tree LeetCode (#1206)

Browse Source 
* add leetcode Distribute Coins in Binary Tree

* updating DIRECTORY.md

* Update 979.c

fix review notes

* Update leetcode/src/979.c

Co-authored-by: David Leal <halfpacho@gmail.com>

* Update leetcode/src/979.c

Co-authored-by: David Leal <halfpacho@gmail.com>

* Update leetcode/src/979.c

Co-authored-by: David Leal <halfpacho@gmail.com>

* Update leetcode/src/979.c

Co-authored-by: David Leal <halfpacho@gmail.com>

---------

Co-authored-by: github-actions[bot] <github-actions@users.noreply.github.com>
Co-authored-by: David Leal <halfpacho@gmail.com>
This commit is contained in:
Alexander Pantyukhin 2023-02-04 04:11:43 +04:00 committed by GitHub
parent 55d8023f06
commit 55f73501ea
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
2 changed files with 48 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

1
leetcode/DIRECTORY.md
View File

@ -112,6 +112,7 @@
| 938 | [Range Sum of BST](https://leetcode.com/problems/range-sum-of-bst) | [C](./src/938.c) | Easy |
| 965 | [Univalued Binary Tree](https://leetcode.com/problems/univalued-binary-tree) | [C](./src/965.c) | Easy |
| 977 | [Squares of a Sorted Array](https://leetcode.com/problems/squares-of-a-sorted-array) | [C](./src/977.c) | Easy |
| 979 | [Distribute Coins in Binary Tree](https://leetcode.com/problems/distribute-coins-in-binary-tree) | [C](./src/979.c) | Medium |
| 985 | [Sum of Even Numbers After Queries](https://leetcode.com/problems/sum-of-even-numbers-after-queries) | [C](./src/985.c) | Medium |
| 997 | [Find the Town Judge](https://leetcode.com/problems/find-the-town-judge) | [C](./src/997.c) | Easy |
| 1008 | [Construct Binary Search Tree from Preorder Traversal](https://leetcode.com/problems/construct-binary-search-tree-from-preorder-traversal) | [C](./src/1008.c) | Medium |

47
leetcode/src/979.c Normal file
View File

@ -0,0 +1,47 @@
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* struct TreeNode *left;
* struct TreeNode *right;
* };
*/
struct NodeDistributeInfo {
int distributeMoves;
int distributeExcess;
};
struct NodeDistributeInfo* getDisturb(struct TreeNode* node) {
struct NodeDistributeInfo* result = malloc(sizeof(struct NodeDistributeInfo));
if (node == NULL) {
result->distributeMoves = 0;
result->distributeExcess = 1;
return result;
}
struct NodeDistributeInfo* leftDistribute = getDisturb(node->left);
struct NodeDistributeInfo* rightDistribute = getDisturb(node->right);
int coinsToLeft = 1 - leftDistribute->distributeExcess;
int coinsToRight = 1 - rightDistribute->distributeExcess;
// Calculate moves as excess and depth between left and right subtrees.
result->distributeMoves = leftDistribute->distributeMoves + rightDistribute->distributeMoves + abs(coinsToLeft) + abs(coinsToRight);
result->distributeExcess = node->val - coinsToLeft - coinsToRight;
free(leftDistribute);
free(rightDistribute);
return result;
}
// Depth-first search .
// On each node-step we try to recombinate coins between left and right subtree.
// We know that coins are the same number that nodes, and we can get coins by depth
// Runtime: O(n)
// Space: O(1)
int distributeCoins(struct TreeNode* root) {
return getDisturb(root)->distributeMoves;
}