why_up的专栏

转自：http://blog.csdn.net/v_july_v/article/details/6347454  #include  #include using namespace std; bool Is_Match(const char *strOne,

//判断n是否为2的幂#includeint foo( int i );int foo_(int i);int foo_1(int );int main(){ int bool1=foo(1); bool1=foo_(1024); bool1

/******* kmp_1.cpp ******/  #include#include#include"kmp_2.h"void get_next(char *T,int *next) //这个函数是重点{ int i=0, j=-1;//j在前，i在

#include #include /* 把字符串整体reverse */void _reverse(char *begin, char *end){ while(end > begin){ char tmp = *end;

#includeusing namespace std;int atioi_(char *s){int sign=1,num=0; if(*s=='-') sign=-1; s++; while((*s)!='\0') {

#include#includechar * strstr_1(char *s1,char *s2);char *strstr_2(char *s1,char *s2);char *strstr_3(char *s1, char *s2);int main(){

int fun(char [ ] );char a[ ]="123";fun(a);得到123#include #include #include using namespace std;int str_2_int(string str){ i

#include #include void rotate(char *start, char *end){ while(start != NULL && end !=NULL && start<end) { char temp=*star

# include # include const int N = 26; int bit_map[N]; void findNoRepeat(char *src) { int pos; char *str = src;

#include#includeusing namespace std;int main (){ char sentence []= "this is a sentence with 7 tokens"; cout <<"this string to be tokenized is "<<endl<<sentence<<endl; char *tokenp=strt