摘要：
struct ListNode *getIntersectionNode(struct ListNode *headA, struct ListNode *headB) { struct ListNode *posA = headA; struct ListNode *posB = headB; i 阅读全文
摘要：
int count; void fun(struct TreeNode* node,int* arr) { if (!node) return; arr[count++] = node->val; fun(node->left,arr); fun(node->right,arr); } int My 阅读全文
摘要：
/** * Definition for a binary tree node. * struct TreeNode { * int val; * struct TreeNode *left; * struct TreeNode *right; * }; */ /* 对于一个公共祖先（一定有子节点才 阅读全文
摘要：
int maxDepth(struct TreeNode* root){ if (root == NULL) { return 0; } int lenLeft = maxDepth(root->left) + 1; int lenRight = maxDepth(root->right) + 1; 阅读全文