摘要：
char * reverseWords(char * s){ char* stack[100]; int pst = 0, len=strlen(s); char* retStr = (char*)calloc(len+1, sizeof(char)); char* temp; temp = str 阅读全文
摘要：
void addPath(int *vec, int *vecSize, struct TreeNode *node) { int count = 0; while (node != NULL) { ++count; vec[(*vecSize)++] = node->val; node = nod 阅读全文
摘要：
#define max(a,b) ((a)>(b))?(a):(b) #define min(a,b) ((a)<(b))?(a):(b) int maxProduct(int* nums, int numsSize){ int i, maxVal=nums[0], res=nums[0], min 阅读全文