自己整理的C面试常考程序题.docx

1/* 字符串倒置*/#include#includevoid func(char* str)int beg,end;char tem;for(beg=0,end=strlen(str)-1;begend;beg+,end-)tem=*(str+beg);*(str+beg)=*(str+end);*(str+end)=tem;puts(str);int main()char str=abcdefghijklmn;func(str);return 0;2/*约瑟夫问题*/#include#includestruct Nodeint data;struct Node* next;int main()int m,n,i;printf(input number: );scanf(%d,&m);struct Node* head,*r,*p,*q;head=(struct Node*)malloc(sizeof(struct Node);p=head;for(i=1;idata=i; p-next=r; p=r;p-next=head-next;p=p-next;printf(start is: );scanf(%d,&n);int j=1;while(jnext;j+;int s;printf(间隔为: );scanf(%d,&s); dofor(i=1;inext; q=p-next; printf(%d ,q-data); p-next=q-next; free(q); p=p-next; m-;while(m0);return 0;3/*String类的实现*/#include#includeusing namespace std;class Stringpublic:String(const char* data=NULL)if(data=NULL)m_data=new char1;*m_data=0;else m_data=new charstrlen(data)+1; strcpy(m_data,data); String(const String& other)m_data=new charstrlen(other.m_data)+1;strcpy(m_data,other.m_data);String(void)delete m_data;String& operator=(const String& other)if(this=&other) return *this; delete m_data; m_data=new charstrlen(other.m_data)+1; strcpy(m_data,other.m_data);void print(void)puts(m_data);private:char* m_data;int main()String s(liushaohui);s.print();String p(s);p.print();String* t=new String(haojiahuo);t-print();String q;q=s;q.print();return 0;4/*定义一个Person类，实现堆的功能*/#includeusing namespace std;class Personpublic:Person(void):m_head(NULL)Person(void)Node* p;while(m_head)p=m_head-m_next;delete m_head;m_head=p;void Push(const char* name,int age)m_head=new Node(name,age,m_head);void Pop(void)if(!m_head) return; else Node* p=m_head-m_next; printf(%s ,%dn,m_head-m_name,m_head-m_age); delete m_head; m_head=p; private:class Nodepublic:Node(const char* name=NULL,int age=0,Node* next):m_name(new charstrlen(name)+1),m_age(age),m_next(next)strcpy(m_name,name);char* m_name;int m_age;Node* m_next;Node* m_head;int main()Person p;p.Push(yangjian,12);p.Push(yangguang,14);p.Push(yangyong,14);p.Pop();p.Push(liuche,14);p.Push(liuxiu,14);p.Push(liuzhi,14);p.Pop();return 0;5/*把一字符串右移多少位*/#include#includevoid move(char* str,int step)char tem100;int n=strlen(str)-step;strcpy(tem,str+n);strcpy(tem+step,str);temstrlen(str)=0;strcpy(str,tem);int main()char str=liushaohui;move(str,4);puts(str);return 0;6/*双向链表的删除插入操作*/#include#includestruct Nodeint data;struct Node* pre;struct Node* next;struct Node* init()struct Node* head,*p,*r;head=(struct Node*)malloc(sizeof(struct Node);head-pre=NULL;head-next=NULL;r=head; int len,i,x;printf(input lenght:);scanf(%d,&len);for(i=0;idata=x; p-next=NULL;p-pre=r; r-next=p; r=p; printf(n); return head; void show(struct Node* head)printf(链表如下: ); struct Node* p=head-next;while(p)printf(%d ,p-data);p=p-next; void insert(struct Node* head,int i,int key)int j;struct Node* p;p=head-next;for(j=1;jnext; if(ji|!p) return; struct Node* t; t=(struct Node*)malloc(sizeof(struct Node); t-data=key; t-pre=p-pre; p-pre-next=t; t-next=p; p-pre=t;void delenode(struct Node* head,int i)int j;struct Node* p;p=head-next;for(j=1;jnext; if(ji|!p) return; p-pre-next=p-next; p-next-pre=p-pre; free(p);int main()struct Node* head;head=init(); show(head); insert(head,3,9);show(head); delenode(head,3);show(head); return 0;7/*字符串的拷贝比较连接求长度操作*/#include#includechar* strcpy(char* str1,const char* str2)assert(str1!=NULL)&(str2!=NULL);char* tem;tem=str1;while(*str1+=*str2+)!=0);return tem;int strlen(const char* str)int len=0;assert(str!=NULL);while(*str!=0)len+;str+;return len;char* strcat(char* str1,const char* str2)assert(str1!=NULL)&(str2!=NULL);char* tem=str1;while(*str1!=0) str1+; while(*str1+=*str2+)!=0); return tem;int strcmp(const char* str1,const char* str2)assert(str1!=NULL)&(str2!=NULL);int ret,n;while(!(ret=*str1-*str2)&str1&str2)str1+;str2+;if(ret0) n=1; else n=0; return n;int main()char str130;char str2=yanggaung;strcpy(str1,str2);puts(str1);int len=strlen(str1);printf(%d n,len);char str3=yangyong;strcat(str1,str3);puts(str1);printf(%dn,strcmp(str1,str3);return 0;8/*字符串变数字 数字变字符串*/#include#include#includevoid stoi(const char* str)assert(str!=NULL);int sum=0;while(*str!=0)sum=sum*10+(*str-0);str+;printf(%dn,sum);void itos(int data)char str10;int i=0;while(data)stri=(char)(data%10+48);i+;data=data/10;stri=0;int beg,end;char tem;for(beg=0,end=strlen(str)-1;begend;beg+,end-)tem=*(str+beg);*(str+beg)=*(str+end);*(str+end)=tem;puts(str);int main()char str=123456;stoi(str);int data=9876;itos(data);return 0;9/*冒泡排序 插入排序 二分查找*/#include#includevoid Bubble(int data,int len)int i,j,tem;for(i=0;ilen-1;i+)bool flag=true;for(j=0;jdataj+1)tem=dataj;dataj=dataj+1;dataj+1=tem;flag=false;if(flag) break;void Insert(int data,int len)int i,j,tem;for(i=1;i0&temright) return -1; int middle=(left+right)/2; if(datamiddle=key) return middle; else if(datamiddlekey) return Binifind(data,middle,right,key); else return Binifind(data,left,right-1,key);int main()int data1=1,43,54,23,756,64,432,464,3,765;int data210;memcpy(data2,data1,40);Bubble(data2,sizeof(data2)/sizeof(data20); Insert(data2,sizeof(data2)/sizeof(data20);int i;for(i=0;i10;i+) printf(%d ,data2i); printf(n); printf(input: ); int key; scanf(%d,&key); printf(%dn,Binifind(data2,0,sizeof(data2)/sizeof(data20),key)+1);return 0;10/*单链表反转*/#include#includestruct Nodeint data;struct Node* next;void reverse(struct Node* head)if(head=NULL) return;struct Node* pre,*cur,*ne;pre=head;cur=head-next;while(cur)ne=cur-next;cur-next=pre;pre=cur;cur=ne;head-next=NULL;head=pre;int main()struct Node* head,*r;head=(struct Node*)malloc(sizeof(struct Node);head-next=NULL;r=head;printf(input number:);int num,i,n;scanf(%d,&num);for(i=0;idata=n;p-next=NULL;r-next=p;r=r-next;reverse(head);struct Node* s=head-next;while(s)printf(%d ,s-data);s=s-next;printf(n);return 0;11/*判断字符串是否回文*/#include#includeint test(const char* str)int beg,end;int n=1;for(beg=0,end=strlen(str)-1;begend;beg+,end-)if(*(str+beg)!=*(str+end)n=-1;break;return n;int main()char str=abcdefgffdcba;printf(%dn,test(str);return 0;12/*判断整数为回文数*/#includeint test(int data)int sum=0;int n,tem;tem=data;while(data)sum=sum*10+data%10;data=data/10;if(sum=tem) n=1; else n=0; return n;int main()int n=123421;printf(%dn,test(n);return 0;13/*大小写转换*/#include void upper(char* str)while(*str!=0)if(*str=a&*str=z) *str-=32; str+;int main(void)char str=liushaohui;upper(str);puts(str);return 0;14./*一的个数*/#includevoid func(int data)int count=0;while(data)count+;data=data&(data-1);printf(%d n,count);int main()int data=127;func(data);return 0;15./*假设现有一个单向的链表，但是只知道只有一个指向该节点的指针p，并且假设这个节点不是尾节点，试编程实现删除此节点*/#include#include#includestruct Nodeint data;struct Node* next;int main()struct Node* head,*p,*r,*s;head=(struct Node*)malloc(sizeof(struct Node);head-next=NULL;r=head;printf(input number:);int cou