作业一
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
/**
判断是否为回文字符串
*/
int main()
{
char a[100];
gets(a);
if(fun(a) == 0){
printf("YES");
}else{
printf("NO");
}
return 0;
}
int fun(char *p){
int len = strlen(p);
char *s = p + len - 1;
while(p!=s){
if(*p != *s){
return -1;
}
p++;
s--;
}
return 0;
}
作业二
#include <stdio.h>
#include <stdlib.h>
/**
删除链表中结点
*/
struct node{
int data;
struct node *p_next;
};
int main()
{
printf("Hello world!\n");
return 0;
}
int func(node *p) {
node *s = p->p_next;
p->p_next=s->p_next;
free(p);
return 0;
}
作业三
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
//字符串反转
int main()
{
return 0;
}
void reverse(char *p,int len){
char *s = p + len - 1;
for(;p != s;p++,s--){
char temp = *p;
*p = *s;
*s = temp;
}
}
void reverseAll(char *p){
reverse(p,strlen(p));
char *s = p + strlen(p) - 1;
int i = 0;
for(;p <=s;p++){
if(p == '\n'){
break;
}
}
}