xinyu913

练习1-13 水平直方图 #include #define OUT 1 #define IN 0 main() {  int c,i,j,nc=0;  int ndigit[10];  int state=OUT;    for(i=0;i   ndigit[i]=0;    while((c=getchar())!=EOF)  {   if(c==' '||c=='\t'||c=='\n')  

首先需要先了解结构体的基本知识： 1.结构体定义： struct 结构体名 ｛ ……结构体成员； ｝ 举例：struct student { char name[10]; int age; }2.结构指针-struct *p 其中，p为指向结构的一个指针，在给p传地址时，要给他传入结构体类型的地址。 举例：struct student *p; st

【指针*与&】指针和数组有异曲同工之妙，在前面博客有专门解释过，指针声明用*，凡是在声明一个变量前面加上这个符号，就是说明声明的这个变量是一个指针，它是一个地址，比如：int a = 2; int *p; p = &a;p就是一个指向整型变量的指针，p指向的是整型变量a的地址，而*在使用的时候还有一个别名，解引用，抵消了&引用功能，&在这里是引用a的地址。*p = 1;//其实*p = *(&a)

#include #include char a[]={'a','b','a','c','a','c','d','e','k','b'}; typedef char key_type; typedef struct node{ key_type key; struct node *next; }node, *pnode; void insert(pnode *root, key_type k

通过键盘输入100以内正整数的加、减运算式，请编写一个程序输出运算结果字符串。 输入字符串的格式为：“操作数1 运算符 操作数2”，“操作数”与“运算符”之间以一个空格隔开

一个字符串压缩程序，将字符串中连续出席的重复字母进行压缩，并输出压缩后的字符串

typedef struct struct_1 struct_1_t; struct struct_1 { int i;

practice 3-6: write a funtion itoa(n,s,width) that could receive the width ,which is the legal least charactor width.if s[] 's width under the limits,make some blank in it to the limits. #include void

practice 3-1:Our binary search makes two tests inside the loop,when one would suffice (at the price of more tests outside).Write a version with only one test inside the loop and measure the difference

practice 2-4:restart compile function squeeze(s1,s2),delete any match characters between string s1 and s2.#include #define MAXLINE 1000 void squeeze(char s1[],char s2[]); void show(char s[]); main() {

practice 2-3:turn hexadecimal into decade   #include #define MAXLINE 100 int ten_digit(char s[]); int power(int m,int n); int change(char c); main() {  char a[MAXLINE];  int result;  gets(a);  result=

practice 4-1: #include #define MAXLINE 1000 int getline(char line[],int max); int strindex(char source[],char searchfor[]); char pattern[]="ould"; main() {  char line[MAXLINE];  int found=0;  while(ge

practice 3-2:Write a function escape(s,t),copy string t to string s,and display some invisable charactor like '\n' '\t' and so on,make them visable,with switch sentence grammer.Then write another func

practice 1-18:delete blank or'\t' at the end of one line of words,also before the \n #include #define MAXWORD 1000 int getline(char line[],int maxline); int removes(char s[]); int main() {  char line[

一天一小步，不能颓了 #include #include #define MAXSIZE 1000 typedef struct {  int data[MAXSIZE];  int last;//记录当前线性表中最后一个元素在数组中的位置,表长last+1 }Seqlist; //顺序表初始化 Seqlist *init_Seqlist() {  Seqlist *L=malloc(sizeof

实现库函数strncpy,strncat,strncmp   char *liw_strncpy(char *s, const char *ct, size_t n) {  char *p;    p = s;  for (; n > 0 && *ct != '\0'; --n)   *p++ = *ct++;  for (; n > 0; --n)   *p++ = '\0';  return

practice 5-3: rewrite strcat(s,t) used pointer,copy string t to the end of string s #include void strcat1(char *s,char *t); void strcpy1(char *s,char *t); main() {  char s1[100]="hello";  char s2[]="x

practice 4-12: #include void printd(int n) {  if(n  {   putchar('-');   n=-n;  }  if(n/10)   printd(n/10);  putchar(n+'0');  return; } main() {  int num=123;  printd(num);  return 0; } practice 4-13:

practice 3-5: Write a function itob(n,s,b),that converts the integer n into a base b character representation in the string s.In particular,itob(n,s,16) formats n as a hexadecimal integer in s. #inclu

practice 2-7:编写汉书invert(x,p,n)将x从第p位开始的n位求反，其余不变 #include unsigned invert(unsigned x,int p,int n) {  return x^(~(~0 } main() {  unsigned num,result;  int m,n;  scanf("%d,%d,%d",&num,&m,&n);  result=i

//统计关键字的个数#include #include #include #define MAXWORD 100 //关键字最大的个数 struct key{  char *word;  int count; }keytab[]={  {"auto",0},  {"break",0},  {"case",0},  {"char",0},  {"const",0},  {"continue",0},

practice 3-3: Write a function expand(s1,s2) which expand the shorthand notation like a-z among the input string s1 into a complete list form a to z like abc...xyz.Allow for letters of either case and

practice 1-16:print any length dialogue #include #define MAXLINE 1000 int getline(char line[],int maxline); //void copy(char to[],char from[]); main() {  int len,i ;  int max;  char line[MAXLINE]; // 

#include #include struct student{  char *name;  char *num;  int weight;  int high;  struct student *right; }; struct student *create(char *na,char *nu,int w,int h); void push_pre(struct student **p,st

practice 5-4:write a function strend(s,t),return 1 if string t show in the end of string s,or return 0 #include #include int strend(char *s,char *t) {  int length1,length2;  length1=strlen(s);  length

practice 2-6:将x中从第p位开始的n个（二进制）位设置为y中最右边n位的值，x的其余各位保持不变 #include unsigned setbits(unsigned x,int p,int n,unsigned y) {  unsigned tmp;  tmp=(~0  x=x&tmp;  y=(y  return x|y; } main() {  int num1,num2,m,n