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

1．/* 字符串倒置*/#includestdio.h#includestring.hvoid 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．/*约瑟夫问题*/#includestdio.h#includestdlib.hstruct Node{int 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;i=m;i++){r=(struct Node*)malloc(sizeof(struct Node)); r-data=i; p-next=r; p=r;}p-next=head-next;p=p-next;printf(start is: );scanf(%d,n);int j=1;while(jn){p=p-next;j++;}int s;printf(间隔为: );scanf(%d,s); do{for(i=1;i=s-1;i++) p=p-next; q=p-next; printf(%d ,q-data); p-next=q-next; free(q); p=p-next; m--;}while(m0);return 0;}3．/*String类的实现*/#includeiostream#includestring.husing namespace std;class String{public:String(const char* data=NULL){if(data==NULL){m_data=new char[1];*m_data=\0;}else{ m_data=new char[strlen(data)+1]; strcpy(m_data,data);}} String(const String other){m_data=new char[strlen(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 char[strlen(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类，实现堆的功能*/#includeiostreamusing namespace std;class Person{public: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 ,%d\n,m_head-m_name,m_head-m_age); delete m_head; m_head=p; }}private:class Node{public:Node(const char* name=NULL,int age=0,Node* next):m_name(new char[strlen(name)+1]