摘要：
int* inorderTraversal(struct TreeNode* root, int* returnSize) { *returnSize = 0; int* res = malloc(sizeof(int) * 501); struct TreeNode** stk = malloc( 阅读全文
摘要：
void recursion(char * s,int slen,char** arr,int* returnSize,char* temp,int tlen,int cnt,int start,int len){ if(cnt==4){ if(tlen==len+4){ arr[(*returnS 阅读全文
摘要：
struct ListNode* reverseBetween(struct ListNode* head, int m, int n){ if (m == n) return head; struct ListNode* root = (struct ListNode*)calloc(sizeof 阅读全文