摘要:
/*深度优先*/ void dfs(char** board,int r,int c,int row,int col) { if (r<0 || r>row-1 || c<0 || c>col-1 || board[r][c] != 'O') return; board[r][c] = 'A'; d 阅读全文
摘要:
int minMoves(int* nums, int numsSize){ int count=0,i,min=nums[0]; for(i=1; i<numsSize; i++) if(nums[i] < min) min = nums[i]; for(i=0; i<numsSize; i++) 阅读全文
摘要:
int cmp(const void* a, const void* b){ return *(int*)b - *(int*)a; } int* minSubsequence(int* nums, int numsSize, int* returnSize){ qsort(nums,numsSiz 阅读全文