摘要：
char ** subdomainVisits(char ** cpdomains, int cpdomainsSize, int* returnSize){ char** arr = (char**)calloc(1000,sizeof(char*)); int* hash = (int*)cal 阅读全文
摘要：
int subtractProductAndSum(int n) { int add = 0, mul = 1; while (n > 0) { int digit = n % 10; n /= 10; add += digit; mul *= digit; } return mul - add; 阅读全文
摘要：
bool func(struct TreeNode* s, struct TreeNode* t) { if (!s && !t) return true; else if (!s || !t) return false; else if (s->val != t->val) return fals 阅读全文
摘要：
int* sumEvenAfterQueries(int* A, int ASize, int** queries, int queriesSize, int* queriesColSize, int* returnSize){ int* answer = (int*)calloc(queriesS 阅读全文
摘要：
void SumLeftNode(struct TreeNode* root,int* sum,int flag) { if (!root) return; if (flag && !root->left && !root->right) *sum += root->val; SumLeftNode 阅读全文
摘要：
void trans(struct TreeNode* root, int cur, int *sum) { if (root == NULL) { return; } cur = cur * 2 + root->val; if (root->left == NULL && root->right 阅读全文