Re: [閒聊] 每日leetcode
※ 引述《sustainer123 (caster )》之銘言：
: https://leetcode.com/problems/evaluate-boolean-binary-tree
: 2331. Evaluate Boolean Binary Tree
: 給定滿二叉樹 root
: root.val == 0為False
: root.val == 1為True
: root.val == 2為or
: root.val == 3為and
: 請回傳root命題之真假值
雖然我很費 但easy還是可以的
C++ code:
/**
* Definition for a binary tree node.
* 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) {}
* };
*/
class Solution {
public:
bool evaluateTree(TreeNode* root) {
if (root->val == 2) {
return evaluateTree(root->left) | evaluateTree(root->right);
}
else if(root->val == 3) {
return evaluateTree(root->left) & evaluateTree(root->right);
}
return root->val;
}
};
--
※ 發信站: 批踢踢實業坊(ptt.cc), 來自: 133.9.52.170 (日本)
※ 文章網址: https://www.ptt.cc/bbs/Marginalman/M.1715879666.A.459.html
推
05/17 01:15,
2周前
, 1F
05/17 01:15, 1F
推
05/17 01:15,
2周前
, 2F
05/17 01:15, 2F
推
05/17 01:15,
2周前
, 3F
05/17 01:15, 3F
推
05/17 01:19,
2周前
, 4F
05/17 01:19, 4F
推
05/17 01:19,
2周前
, 5F
05/17 01:19, 5F
推
05/17 01:21,
2周前
, 6F
05/17 01:21, 6F
推
05/17 01:28,
2周前
, 7F
05/17 01:28, 7F
推
05/17 02:04,
2周前
, 8F
05/17 02:04, 8F
討論串 (同標題文章)