yecats的博客

#include"stdio.h"main(){ int arr[10]; int i ; for(i=0;i<10;i++){ if(i==0||i==1){ arr[i]=1; } else{ arr[i]=0; } } for(i=2;i

#define MAXSIZE 10#define ADDSIZE 5typedef int ElemType;typedef struct{ ElemType *elem; int length; int size;}SqList;#include "stdio.h"#include "malloc.h"#include"head.h"void Ini

#include"stdio.h"#include"malloc.h"#include"LinkStack.c"typedef int ElemType;typedef struct BitNode{ ElemType data; struct BitNode *lchild,*rchild;}BitTree;//1、利用前序遍历递归创建二叉树BitTree *

#include"stdio.h"struct vote{ int count; char name[10];}cand[4]={{0,"3"},{0,"4"},{0,"5"},{0,"6"}};main(){ int i,j,c_max=0,max_index=0; char cname[10]; printf("进入投票:\n"); fo

#include "stdio.h"#include #define MAXSIZE 10typedef int ElemType;typedef struct Node{ int front,rear; ElemType elem[MAXSIZE];}SqQueue;SqQueue * InitQueue(){ SqQueue *q; q=(SqQ

#include"stdio.h"//从文件中读取内容main(){ FILE *fp; fp=fopen("f://1.txt","r"); if(fp==NULL){ printf("读取失败！"); }else{ while(feof(fp)!=-1){ char ch=fgetc(fp); putchar(ch); } fclose(fp); }}

#include"stdio.h"void swap(int arr[],int low,int high){ int temp; temp = arr[low]; arr[low]=arr[high]; arr[high]=temp;}int partition(int arr[],int low,int high){ int point;

void get2(int a,int b,int c){ int temp = 0; if(a<b){ temp=b; b=a; a=temp; } if(a<c){ temp=c; c=a; a=temp; }if(c<b){

#include"stdio.h"main(){ int arr[4]; int i ,j; for(i=0;i<4;i++){ scanf("%d",&arr[i]); } for(i=0;i<4;i++){ int temp=0; for(j=i;j<4;j++){ if(arr

#include"stdio.h"//可以与上一篇文章进行对比，进一步掌握指针概念void sort(int *x,int *y,int *z){ int temp; if(*x>*y){ temp=*x; *x=*y; *y=temp; } if(*x>*z){ temp=*x;

#include"stdio.h"#include"math.h"main(){ int arr[10]={1,2,3,4,5,6,7,8,9,0},i; int *p[10]; for(i=0;i<10;i++){ p[i]=&arr[i]; } for(i = 0;i<10;i++){ printf("%4d",*p

#include"stdio.h"struct student{ int code; char name[10]; char sex[3]; int age;}stu;main(){ struct student stus[4]; int i; struct student *s; for(i=0;i<4;i++){

#include "stdio.h"#include "malloc.h"#define MAXSIZE 100typedef int datatype;#define NULL 0typedef struct{ datatype stack[MAXSIZE]; int top;}seqstack;seqstack * InitStack(seqstack *s

#include "stdio.h"#include "malloc.h"#define MAXSIZE 10#define ADDSIZE 5typedef int ElemType;typedef struct{ ElemType *elem; int length; int size;}SqList;void InitList(SqList *L){

反之亦然！

#include#includevoid eval(char *);//double cal(double,char,double);//int main(void){ char input[100]; printf("输入后序运算式："); scanf("%s",input); eval(input); return 0;}//计算后序式int eval(char *fi

#include"stdio.h"struct student{ int code; char name[10]; char sex[3]; int age;}stu;main(){ struct student stus[4]; int i; for(i=0;i<4;i++){ struct student s

#include"stdio.h"#include"malloc.h"typedef int ElemType;typedef struct QNode{ ElemType data; struct QNode *next;}LinkQueue;typedef struct PointerNode{ LinkQueue *front,*rear;}QueueP

#include"stdio.h"#include"math.h"main(){ char *arr[3]={"fsd","fdsf","fere"}; int i; for(i=0;i<3;i++){ printf("arrary:%s\n",arr[i]);//存的每一个的值，首地址，自动依次读到最后，故为一个串 } for(i=0

#include"stdio.h"#include"math.h"main(){ /* int arr[10]= {1,2,3,4,5,6,7,8,9,10},i,j; int *p; p=arr; for(i=0;i<10;i++){ printf("%5d",*p++); }*/ /* int arr[3][

#include"stdio.h"#include"string.h"//找出个数最多的字符main(){ char str[50],*p1,*p2,*max_p; int count=0,maxcount=0; gets(str); p1=str; for(p1;*p1!='\0';p1++){ count=0;

#include"stdio.h"#include"malloc.h"#define format "%d %s %s %d"struct student{ int code; char name[10]; char sex[3]; int age; struct student *next;};//初始化头节点struct student *

#include"stdio.h"void selectSort(int a[],int n){ int i,j,min_index; for(i=0;i<n-1;i++){ min_index = i;//固定索引 for(j=i+1;j<n;j++){ if(a[min_index]>a[j]){//交换索引

#includeusing namespace std;//输入一个整数判断是否是回文int main(){ int val; //存放待判断的数字，不超过10位数的回文数字 int m; int sum = 0; printf("请输入您需要判断的数字：\n"); scanf("%d",&val); m = val; while (m) { sum = sum*10 +

#include"stdio.h"void sort(int arr[],int n){ int i ,j ,temp,f; for(i=0;i<n-1;i++){ f=1; for(j=0;j<n-1-i;j++){ if(arr[j]>arr[j+1]){ f=0;//排了就变零

#include"stdio.h" void print(int x){ printf("%d ",x); }main(){ typedef void (*fu)(int x);//函数 重命名 fu f=&print;//or f=print;指向print函数 f(64000);}

#include "stdio.h"#include "malloc.h"typedef int ElemType;typedef struct node{ ElemType data; struct node *next;}LinkStack;LinkStack * InitStack(){ LinkStack *s; s=(LinkStack *

#include"stdio.h"//猴子吃桃问题int get(int n,int toal){ if(n==1){ return toal; } return get(n-1,(toal+1)*2);}//兔子生产问题int fb(int n,int a,int b){ int temp =0; temp = b; b=

#include"stdio.h"void sort(int arr[],int n){ int i ,j ,temp,f; for(i=0;i<n-1;i++){ f=1; for(j=0;j<n-1-i;j++){ if(arr[j]>arr[j+1]){ f=0;//排了就变零

#include"stdio.h"main(){ int arr[10]={1,2,3,4,45,5,6,7,7,12},i; int *p_arr[10]; int **p_p_arr; p_p_arr=p_arr; for(i=0;i<10;i++){ p_arr[i]=&arr[i]; } for(i=0;i<10;i

#include"stdio.h"struct student{ int code; char name[10]; char sex[3]; int age;}stu;main(){ //struct student stu; printf("学号、姓名、性别、年龄:"); scanf("%d %s %s %d",&stu.code,s

#include"stdio.h"#error ""struct student{ int code; char name[10]; char sex[3]; int age;}stu;main(){ struct student *s; s=&stu; printf("学号、姓名、性别、年龄:"); scanf("%d %s

//实现将一个字符串中的'\t'换成四个空格， '\t'个数不定。 #include "stdio.h"#define TOTAL_LEN 1024//是'\t'返回1int IsCharTab(char chData){ return (('\t' == chData) ? 1 : 0);}//当str = '/'并且 str+1 = 't',即 "/t"int IsStrTab(const c

#include"stdio.h"#include"math.h"main(){ int size,i; int* base =NULL,* p; printf("输入大小;"); scanf("%d",&size); base = (int *)malloc(sizeof(int)*size);//堆，需要释放free() p=base;

#include "stdio.h"#include #define MAXSIZE 10typedef int ElemType;typedef struct Node{ int front,rear; ElemType elem[MAXSIZE];}SqQueue;SqQueue * InitQueue(){ SqQueue *q; q=(SqQ