llllmz

摘要： int max(int i,int j){ if(i>j) return i; return j; } void reverse(char* s,int head,int tail){ while(head<=tail){ char c=s[head]; s[head]=s[tail]; s[tai 阅读全文

摘要： bool judge(char* s1,char* s2,int n){ for(int i=0;i<n;i++){ if(s1[i]!=s2[i]) return false; } return true; } char* longestCommonPrefix(char** strs, int 阅读全文

摘要： int max(int i,int j){ if(i>j) return i; return j; } int maxProfit(int* prices, int pricesSize) { int** dp=(int**)malloc(sizeof(int*)*pricesSize); for( 阅读全文

摘要： /** * Return an array of arrays of size *returnSize. * The sizes of the arrays are returned as *returnColumnSizes array. * Note: Both returned array a 阅读全文

摘要： /** * Return an array of arrays of size *returnSize. * The sizes of the arrays are returned as *returnColumnSizes array. * Note: Both returned array a 阅读全文

摘要： /** * Return an array of arrays of size *returnSize. * The sizes of the arrays are returned as *returnColumnSizes array. * Note: Both returned array a 阅读全文

摘要： /** * Note: The returned array must be malloced, assume caller calls free(). */ char temp[10]; char c[10][5]={" "," ","abc","def","ghi","jkl","mno","p 阅读全文

摘要： /** * Return an array of arrays of size *returnSize. * The sizes of the arrays are returned as *returnColumnSizes array. * Note: Both returned array a 阅读全文

摘要： /** * Definition for a binary tree node. * struct TreeNode { * int val; * struct TreeNode *left; * struct TreeNode *right; * }; */ struct TreeNode* bu 阅读全文

摘要： /** * Definition for a binary tree node. * struct TreeNode { * int val; * struct TreeNode *left; * struct TreeNode *right; * }; */ struct TreeNode* tr 阅读全文