爱去玩的专栏

#include#includevoid main(){char a[20];char *p;int n;gets(a);n=strlen(a);printf("逆序输出/n");for(p=(a+n-1);p>=(a+0);p--)printf("%c",*p);printf("/n");}

void mystrcpy(char *target, char *source){ while((*target = *source) != '\0') { source++; target++; }}void mynstrcpy(char *target, char *source, int n){ int i = 0; while((i < n) && (*tar

#include int mylen(char *str);int main(){ char *str = "haha"; printf("len = %d", mylen(str)); return 0;}int mylen(char *str){ if(str == NULL) return 0; int len = 0; for(; *str++ != '\0'

#include #include int Swquential_Search(int *a, int n, int key){ int i; a[0] = key; i = n; while(a[i] != key) { i--; } return i;}

#include #include #define MAX_SIZE 5typedef struct Stack{ int top; int data[MAX_SIZE];}Stack;Stack* initStack(){ Stack *s = (Stack *)malloc(sizeof(Stack)); s->top = 0; for(int i = 0;

Node *create(){ DoubLink *list; Node *p, *pNew, *pHead; pHead = (Node *)malloc(sizeof(Node)); pHead->next = NULL; pHead->prior = NULL;//第一个节点 p = pHead; //指针p指向第一个节点 for(int i = 0; i < 20;

Node *create(){ int n = 20; Node *pNew, *pTail, *pHead; pHead = (Node *)malloc(sizeof(Node)); pHead->next = pHead;//空链表 自己指向自己 pTail = pHead; //pTail指针指向pHead节点 for(int i = 1; i <= n; i++)

#include #include typedef struct Node{ int data; //数据域 Node *next; //指针域，指向下一个Node节点}Node;Node *create(); //创建一个单链表int deleteFromList(Node *linkList, int i); //删除节点 成功返回0 否则-1int insertInto

1.从字符串中提取某个数字char str[] = "level_0.json";int i = -1;sscanf(str, "level_%d.json", &i);cout

<br />#include"stdio.h"<br />main()<br />{<br />int i,j,a[10][10];<br />for(i=0;i<10;i++)<br />{<br />for(j=0;j<=i;j++)<br />{<br />if(i==j||j==0)<br />a[i][j]=1;                       //边上的全是1。。。就靠这个了<br />else<br />a[i][j]=a[i-1][j-1]+a[i-1][j];         

功能是：从键盘输入字符以空格隔开 当输入q或者Q时按回车表示输入结束先放出main函数int main(){ MyNode *myNode = (MyNode *)malloc(sizeof(MyNode)); if (NULL == myNode) { return 0; } getNum(myNode); so