摘要：
int recursion(struct TreeNode* root, bool* flag){ if (!root || *flag=false) return 0; int left=recursion(root->left,flag); int right=recursion(root->r 阅读全文
摘要：
#define mod 1000000007 int breakfastNumber(int* staple, int stapleSize, int* drinks, int drinksSize, int x){ int cnt[100001] = {0}; for (int i=0; i<dr 阅读全文
摘要：
int cmp(const void* a, const void* b){ return *(int*)a-*(int*)b; } void nextPermutation(int* nums, int numsSize){ int i,left,pst=0,val,temp; int* arr= 阅读全文
摘要：
int exchangeBits(int num){ double i = 0; int even, ood; int val = num; while (val){ even = num & (int)pow(2.0,i); ood = num & (int)pow(2.0, i + 1); if 阅读全文