-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
8 changed files
with
86 additions
and
6 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
|
|
@@ -4,7 +4,7 @@ build-backend = "setuptools.build_meta" | |
|
|
||
| [project] | ||
| name = "leetcode" | ||
| version = "0.0.8" | ||
| version = "0.0.9" | ||
| authors = [ | ||
| {name = "Alexandr Morev", email = "[email protected]"}, | ||
| ] | ||
|
|
||
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1 @@ | ||
| add_catch(test_even_odd_tree test.cpp) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,40 @@ | ||
| #pragma once | ||
|
|
||
| #include <ranges> | ||
| #include <vector> | ||
|
|
||
| #include <tree_node.h> | ||
|
|
||
| // Time: O(N) | ||
| // Space: O(N) | ||
|
|
||
| class Solution { | ||
| public: | ||
| static bool isEvenOddTree(TreeNode *root) { | ||
| std::vector<TreeNode *> nodes{root}; | ||
| for (int level = 0; !nodes.empty(); ++level) { | ||
| if (std::ranges::any_of(nodes, [=](TreeNode *node) { | ||
| return (node->val & 1) == (level & 1); | ||
| })) { | ||
| return false; | ||
| } | ||
|
|
||
| if (!std::ranges::is_sorted(nodes, [=](TreeNode *lhs, TreeNode *rhs) { | ||
| return level & 1 ? lhs->val >= rhs->val : lhs->val <= rhs->val; | ||
| })) { | ||
| return false; | ||
| } | ||
|
|
||
| std::vector<TreeNode *> next; | ||
| for (auto *node : nodes) { | ||
| for (auto *child : {node->left, node->right}) { | ||
| if (child) { | ||
| next.push_back(child); | ||
| } | ||
| } | ||
| } | ||
| nodes.swap(next); | ||
| } | ||
| return true; | ||
| } | ||
| }; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,37 @@ | ||
| #include <catch.hpp> | ||
|
|
||
| #include <solution.hpp> | ||
|
|
||
| #include <tree_node.h> | ||
|
|
||
| TEST_CASE("Simple") { | ||
| struct TestCase { | ||
| Tree root; | ||
| bool expected; | ||
| }; | ||
|
|
||
| std::vector<TestCase> test_cases{ | ||
| { | ||
| .root = {1, 10, 4, 3, std::nullopt, 7, 9, 12, 8, 6, std::nullopt, | ||
| std::nullopt, 2}, | ||
| .expected = true, | ||
| }, | ||
| { | ||
| .root = {5, 4, 2, 3, 3, 7}, | ||
| .expected = false, | ||
| }, | ||
| { | ||
| .root = {5, 9, 1, 3, 5, 7}, | ||
| .expected = false, | ||
| }, | ||
| { | ||
| .root = {2, 12, 8, 5, 9, std::nullopt, std::nullopt, 18, 16}, | ||
| .expected = false, | ||
| }, | ||
| }; | ||
|
|
||
| for (const auto &[root, expected] : test_cases) { | ||
| const auto actual = Solution::isEvenOddTree(root); | ||
| REQUIRE(expected == actual); | ||
| } | ||
| } |