摘要：
void dfs(char** grid, int gridSize, int* gridColSize, int r, int c){ if (r < 0 || r >= gridSize || c < 0 || c >= *gridColSize || grid[r][c] != '1') re 阅读全文
摘要：
/** * Definition for a binary tree node. * struct TreeNode { * int val; * struct TreeNode *left; * struct TreeNode *right; * }; */ /** * Note: The ret 阅读全文
摘要：
typedef struct{ int hash[4]; }st; int judge(char* s,int start,st* arr,int* size,int* map){ int i, add=0; for (i=start; i<start+10; i++){ if(arr[add].h 阅读全文