hello2sys_cs的专栏

Type Find(Type *ID,int N) {//寻找发帖"水王",假设只有一个 Type candidate; int nTimes,i; for( i = nTimes = 0; i < N; i++) { if(nTimes == 0) { candidate = ID[i]; nTimes = 1; } else { if(candi

int FactorialZeroNum1(int N) {//N!末尾有多少个0，求1..N各个数的5的因子有多少个 int ret = 0; for(int i = 1 ; i <= N ; ++i) { int j = i; while( j % 5 == 0) { ret++; j /= 5; } } return ret; } int Facto

#include void RightShift1(int *arr,int N,int K) {//循环右移 K %= N; while(K--) { int t = arr[N - 1]; for(int i = N - 1; i > 0;--i) { arr[i] = arr[i - 1]; } arr[0] = t; } } void Reverse

int gcd1(int x,int y) {//欧几里得辗转相除法 return (!y)?x:gcd1(y,x % y); } int gcd2(int x,int y) {//能除的尽x,y的数，也能除的尽x-y,y if( x < y) return gcd2(y,x); if( y == 0 ) return x; else return gcd2(x - y,

void DeleteRandomNode(node *pCurrent) {//从无头单链表中删除结点 assert(pCurrent != NULL); node *pNext = pCurrent->next; if(pNext != NULL) { pCurrent->next = pNext->next; pCurrent->data = pNext->data;

int StrInStr1(char *src,char *des) {//方法一：穷举src循环移位的字符串组合，每个都跟des比较 int len = strlen(src); for( int i = 0; i < len; ++i) { char tempchar = src[0]; for( int j = 0; j < len - 1;++j) //循环左移