沒(méi)什么好說(shuō)的，判斷兩個(gè)數(shù)是不是一樣，簡(jiǎn)單題
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Solution {public: bool mark; void is(TreeNode* p, TreeNode* q){ if(!mark) return ; if(p == NULL && q == NULL) return ; if(p == NULL && q != NULL){ mark = false; return ; } else if(p != NULL && q == NULL){ mark = false; return ; } else if(p -> val != q -> val){ mark = false; return ; } is(p -> left, q -> left); is(p -> right, q -> right); return ; } bool isSameTree(TreeNode* p, TreeNode* q) { mark = true; is(p, q); return mark; }};新聞熱點(diǎn)
疑難解答
圖片精選
網(wǎng)友關(guān)注
