- 博客(6)
- 收藏
- 关注
RSS订阅原创 linkstack.cpp
#define _CRT_SECURE_NO_WARNINGS 1#include"linkstack.h"//入栈int Push(LinkStack &S, SElemType e){ StackNode*p; p = (StackNode*)malloc(sizeof(StackNode)); p->data = e;//链栈不需要判断栈满 S->next = p; S = p; return 0;}//出栈int P...
2022-04-17 16:16:46
90
原创 linkstack.h
#pragma once#include<stdio.h>#include<stdlib.h>#define MAXSIZE 100typedef int SElemType;//链栈的存储结构typedef struct StackNode{ SElemType data; struct StackNode *next;}StackNode, *LinkStack;//StackNode和LinkStack是不同名字的同一指针类型； .
2022-04-17 16:15:57
1092
原创 test.cpp
#include"linkstack.h"int main(){ LinkStack S; int e; InitStack(S); printf("请输入一个要入栈的元素（-1表示结束）："); scanf_s("%d", &e); while (e != -1) { Push(S, e); printf("请输入一个要入栈的元素（-1表示结束）："); scanf_s("%d", &e); } printStack(S); printf("出栈测试.
2022-04-17 16:14:41
73
原创 2012 11 19加油哦
#define _CRT_SECURE_NO_WARNINGS 1;#include <stdio.h>int add(int x, int y){ int z; z = x + y; return z;}int sub(int x, int y){ int z; z = x - y; return z;}int mut(int x, int y){ int z; z = x*y; return z;}int div(int x, int y){ i.
2021-11-19 10:35:18
298
原创 2021-11-11加油哦
#define _CRT_SECURE_NO_WARNINGS 1;#include <stdio.h>void main(){//计算n的阶乘 int i = 0; int n = 0; int sum = 1; scanf("%d", &n); for (i = 1; i <= n; i++) { sum = sum * i; } printf("sum=%d",sum);}
2021-11-11 20:05:04
192
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人