摘要：
bool dfs(char** board, int rSize, int* cSize, char* word, int r, int c, int cnt){ if(r>=rSize || r<0 || c>=*cSize || c<0 || board[r][c]!=word[cnt]) re 阅读全文
摘要：
int maxValue(int** grid, int gridSize, int* gridColSize){ int i, j, temp1, temp2; for(i=gridSize-1; i>=0; i--){ for(j=gridColSize[i]-1; j>=0; j--){ te 阅读全文
摘要：
#define MANLEN 1000 void recursion(struct ListNode* l1, struct ListNode* l2,int* res,int* len,int* flag,int* pst){ if(l1 || l2){ *(pst)=(l1)?1 :0; int 阅读全文
摘要：
bool isNumber(char* s){ int i, j, pcnt = 0, ecnt = 0, dcnt = 0, scnt=0, len = strlen(s); for (i = 0; i<len; i++){ if (s[i] == '+' || s[i] == '-'){ if 阅读全文