xxaichishizi的博客

List *list_middle(List *l){List *p1;List *p2;p1 = p2 = l;while(p1 != NULL){if(p1->next){p1 = p1->next->next;}else{return p2;p2 = p2->next;}}return p2;}

* * * * * * * * ** * * * * * * * * * * * * * * * #include int main(){ int i,j,k; for(i=1;i<5;i++) //上四行 { for(j=1;j<=5-i;j++) printf(" "); //空格 for(k=1;k<=2*i-1;k

输入一个32位的整数a,使用按位异或^运算,生成一个新的32位整数b,使得该整数b的每一位等于原整数a中该位左右两边两个bit位的异或结果#include int main(){ int a,temp1,temp2; //定义数字a,p1,p2;临时变量temp int c[32],b[32]; //定义两个数组 int i,j; //循环变量 j = 0;

题目:输入一个整数a,再输入两个整数p1,p2(p1,p2#include int main(){ int a,p,v,temp; //定义数字a,p,v;临时变量temp int c[32],b[32]; //定义两个数组 int i,j; //循环变量 j = 0; printf("输入数字a："); //输入a,p1,p2 scanf("%d",&

输入一个整数a,再输入两个整数p1,p2(p1,p2#include int main(){ int a,p1,p2,temp; //定义数字a,p1,p2;临时变量temp int c[32],b[32]; //定义两个数组 int i,j; //循环变量 j = 0; printf("输入数字a："); //输入a,p1,p2 scanf("%d",

题目:输入一个整数a,再输入两个整数p1,p2(p1,p2#include int main(){ int a,p1,p2,temp; //定义数字a,p1,p2;临时变量temp int c[32],b[32]; //定义两个数组 int i,j; //循环变量 j = 0; printf("输入数字a："); //输入a,p1,p2 scanf("%

int main(){ FILE *fp1; FILE *fp2; FILE *fp3; char ch1; char ch2; char ch3; if((fp1 = fopen("text1.txt","r")) == NULL) { printf("file is error!\n"); exit(0); } if((fp2 = fopen("text2.t

找最长回文字符串#include int main(){ char str[100]; int i;//循环变量 int n;//字符串位数 int temp1,temp2; int j = 1; int count = 0; int flag = 0; printf("输入字符串（100个字符以内）："); scanf("%s",str); printf("输入字符串

例：“ABCDEFG”，8，4输出：“EFGABCD”#include void xuanzhuan(char str[20],int n,int p){ int i = 0; int j = 0; char new[20]; for(i = 0;i <= p;i++) { new[j + p - 1] = str[i]; j++; } j = 0; for(

#include #include #include /******************************* 函数声明＊＊＊＊＊＊＊＊＊＊＊＊ *******************************/void interface();void select_menu(sqlite3 *db);void create_table(sqlite3 *db);voi

#include #include //定义结构体＊＊＊＊＊＊＊＊＊struct dblnode{ char num[10];//学号 char name[5];//姓名 char sex[2];//性别 char tel[12];//性别 char add[100];//地址 struct dblnode *next,*prior;//指针域};typedef str

编写函数int stat(int a[],int n,int c[][2])。a指向的数组中保存了由n个1位整数组成的数列（n为偶数）。函数从前至后依次将a数组中每两个相邻元素拼成一个不超过2位的整数，从而生成有n/2个元素组成的整数数列；统计该数列中不同整数各自出现的次数，并将统计结果保存到c指向的二维数组中。函数返回不同整数的个数。#include #include #define N

#include#include#include#include#include#include#include#includeint main(int argc,char *argv[]){ int ffd,tfd; int byteread,bytewrite; char buffer[1024]; char *ptr; if(argc != 3) //

打开当前目录下的文件 foo.txt ，并将其内容显示出来。如果该文件不存在，就报告错误并退出。#include#include#include#include#include#include#define BUFFERSIZE 1024int main(int argc,char *argv[]){ int openfile; int byteread;

#include#include //strlen#include#include //inet_addr int main(int argc , char *argv[]){ int socket_desc; struct sockaddr_in server; char *message , server_reply[2000];

#include //printf#include //strcpy#include#include //hostent#include int main(int argc , char *argv[]){ // char *hostname = "www.163.com"; char *hostname = "www.njit.edu.cn"; char i

#include#include#include //inet_addr int main(int argc , char *argv[]){ int socket_desc; struct sockaddr_in server; //Create socket socket_desc = socket(AF_INET , SOCK_STREA

#include#include#include //inet_addrint main(int argc , char *argv[]){ int socket_desc; struct sockaddr_in server; //Create socket socket_desc = socket(AF_INET , SOCK_STR

#include#include#include //inet_addr int main(int argc , char *argv[]){ int socket_desc , new_socket , c; struct sockaddr_in server , client; //Create socket socket_desc = s

#include #include #include #include #include void do_ls(char[]);void dostat(char *);void show_file_info( char *, struct stat *);void mode_to_letters( int , char [] );char *uid_to_name( uid_t

#include#include //strlen#include //strlen#include#include //inet_addr#include //write #include //for threading , link with lpthread void *connection_handler(void *); int main(int

#include#include //strlen#include#include //inet_addr int main(int argc , char *argv[]){ int socket_desc; struct sockaddr_in server; char *message; //Create socket s

程序功能：建立一个单向链表，并将存储在数组中的字符依次转储到链表的各个结点中。#include #include #include struct node //定义结点的结构{ int num; //数据域 struct node * next;//指针域};typedef struct node Node;//给结构体命名为Nodetypedef struct no

有n个人围成一圈,顺序排号,从第一个开始报数(从1到3报数),凡报到3的人退出圈子,问最后最后留下的是原来第几号的那位.#include int baoshu(int n) //定义一个报数的函数{ int a[n]; int i,count,num,flag;//i为循环变量，count为1～n人次循环，num为3人循环 ，flag为标记原来位 count = 0; num

#include #include int find(char str[],char sub[]){ int i,j,count,n,size; n = 0; size = strlen(str); for(i = 0;i < size;i++) { j = 0; count = 0; while((str[i] == sub[j]) && (sub[j]) !=

#include #include struct dblnode{ struct dblnode * prior; int num; struct dblnode * next;};typedef struct dblnode Dblnode;typedef struct dblnode * Dbllink;void create_dbllink(Dbllink *hea

输入一个整数a,再输入两个整数p1,p2(p1,p2include int main(){int a,p1,p2,temp; //定义数字a,p1,p2;临时变量tempint c[32],b[32];  //定义两个数组int i,j;          //循环变量j = 0;printf("输入数字a："); //输入a,p1,p2

#include #include struct student{ int num; struct student * next;};typedef struct student STU;typedef struct student * Link;void create_link(Link *head){ *head = NULL;}void is_malloc_o

#include #include struct student{ int num; struct student * next;};typedef struct student STU;typedef struct student * Link;void create_newnode(Link *newnode);void create_link(Link *head);

#include int jishu(int n) //定义计9个数函数{ printf("输入最大数："); scanf("%d",&n); //输入最大数字 int i,count,temp1,temp2; //定义循环变量，计数count，临时变量temp1、temp2 count = 0; for(i = 1;i <= n;i++) //1～n { temp1 =

#include #include struct node{ int num; struct node * next;};typedef struct node Node;typedef struct node * Link;void create_link(Link * head){ *head = NULL;}void insert_node_head(Lin

#include #include struct node //定义结点的结构{ int num; //数据域 struct node * next;//指针域};typedef struct node Node;//给结构体命名为Nodetypedef struct node * link;//给指向结构体的指针命名为linkvoid create_link(link

编写函数fun(int *a, int n, int *odd, int *even)，功能是：求出数组a[]中所有奇数之和以及所有偶数之和。并利用指针odd返回奇数之和，利用指针even返回偶数之和。 例如：a[]的值依次为：1，9，2，3，11，6；则利用指针odd返回奇数之和24；利用指针even 返回偶数之和 8。#include #define N 6void fun(int

#include #include struct node{ int num; struct node * next;};typedef struct node Node;typedef struct node * Link;void create_link(Link * head){ *head = NULL;}void insert_node_head(Lin

#include #include #define N 4int main(){ int a[N][N]; //定义数组方阵 int i,j,temp; srand(time(NULL));//初始化 for(i = 0;i < N;i++) { for(j = 0;j <N;j++) a[i][j] = rand() % 100;//产生的随机数小于100 }

#include #define N 10 //输出十行int main(){ int a[N][N]; int i,j; for(i = 0;i < N;i++) //第一列和对角线为1 { a[i][0] = 1; a[i][i] = 1; } for(i = 2;i <= N;i++) { for(j = 1;j < i;j++)

id#include #include #include /*getpid()*/void *create(void *arg){ printf("New thread .... \n"); printf("This thread's id is %u \n", (unsigned int)pthread_self()); printf("

编写一个C函数,将”I am from shanghai ”倒置为”shanghai from am I”,及将句子中的单词位置倒置,而不改变单词内部结构.#include void nixu(char *str){ char *head = str;//作为指向每个单词的起始指针 char *tail = str;//作为指向每个单词结尾的指针 char *mid = str;/