摘要：
void recursion(struct TreeNode* root,int sum,int* returnSize,int* returnColumnSizes,int**arr,int* temp,int cnt,int* total){ if(!root) return; *(total) 阅读全文
摘要：
struct TreeNode* buildTree(int* inorder,int inorderSize,int* preorder,int preorderSize){ if(preorderSize==0 || inorderSize==0) return NULL; struct Tre 阅读全文
摘要：
int getLength(struct ListNode* head) { int ret = 0; while (head != NULL) { ++ret, head = head->next; } return ret; } struct TreeNode* buildTree(struct 阅读全文
摘要：
int** zigzagLevelOrder(struct TreeNode* root, int* returnSize, int** returnColumnSizes){ int** arr = (int**)calloc(100, sizeof(int*)); *returnSize = 0 阅读全文