diff options
| author | Yuqian Yang <crupest@crupest.life> | 2025-02-28 23:13:39 +0800 |
|---|---|---|
| committer | Yuqian Yang <crupest@crupest.life> | 2025-02-28 23:13:39 +0800 |
| commit | dc1f0c4c0096013799416664894c5194dc7e1f52 (patch) | |
| tree | 2f5d235f778cd720f4c39ec3e56b77ba6d99f375 /works/solutions/leetcode/cpp/1609.cpp | |
| parent | 7299d424d90b1effb6db69e3476ddd5af72eeba4 (diff) | |
| download | crupest-dc1f0c4c0096013799416664894c5194dc7e1f52.tar.gz crupest-dc1f0c4c0096013799416664894c5194dc7e1f52.tar.bz2 crupest-dc1f0c4c0096013799416664894c5194dc7e1f52.zip | |
chore(store): move everything to store.
Diffstat (limited to 'works/solutions/leetcode/cpp/1609.cpp')
| -rw-r--r-- | works/solutions/leetcode/cpp/1609.cpp | 94 |
1 files changed, 0 insertions, 94 deletions
diff --git a/works/solutions/leetcode/cpp/1609.cpp b/works/solutions/leetcode/cpp/1609.cpp deleted file mode 100644 index e446c0f..0000000 --- a/works/solutions/leetcode/cpp/1609.cpp +++ /dev/null @@ -1,94 +0,0 @@ -struct TreeNode
-{
- int val;
- TreeNode *left;
- TreeNode *right;
- TreeNode() : val(0), left(nullptr), right(nullptr) {}
- TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
- TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
-};
-
-#include <queue>
-
-class Solution
-{
-public:
- bool isEvenOddTree(TreeNode *root)
- {
- if (root == nullptr)
- return true;
- std::queue<TreeNode *> odd_level;
- std::queue<TreeNode *> even_level;
-
- even_level.push(root);
-
- while (true)
- {
- if (!odd_level.empty())
- {
- auto node = odd_level.front();
- odd_level.pop();
- if (node->left)
- even_level.push(node->left);
- if (node->right)
- even_level.push(node->right);
- int last = node->val;
- if (last % 2 != 0)
- return false;
-
- while (!odd_level.empty())
- {
- node = odd_level.front();
- odd_level.pop();
- if (node->left)
- even_level.push(node->left);
- if (node->right)
- even_level.push(node->right);
- int val = node->val;
- if (val % 2 != 0)
- return false;
- if (val >= last)
- return false;
- last = val;
- }
-
- continue;
- }
-
- if (!even_level.empty())
- {
- auto node = even_level.front();
- even_level.pop();
- if (node->left)
- odd_level.push(node->left);
- if (node->right)
- odd_level.push(node->right);
- int last = node->val;
- if (last % 2 == 0)
- return false;
-
- while (!even_level.empty())
- {
- node = even_level.front();
- even_level.pop();
- if (node->left)
- odd_level.push(node->left);
- if (node->right)
- odd_level.push(node->right);
- int val = node->val;
- if (val % 2 == 0)
- return false;
- if (val <= last)
- return false;
- last = val;
- }
-
- continue;
- }
-
- break;
- }
-
- return true;
- }
-};
\ No newline at end of file |