Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

数据结构(2) | 瑜璟博客 #29

Open
yujingsea opened this issue Jan 12, 2022 · 0 comments
Open

数据结构(2) | 瑜璟博客 #29

yujingsea opened this issue Jan 12, 2022 · 0 comments

Comments

@yujingsea
Copy link
Owner

https://yujingsea.github.io/2022/01/12/26/

栈定义堆栈(Stack): 具有一定操作约束的线性表,只在一端(栈顶,Top)做插入、删除 特点:后入先出 栈的操作: 1、Stack CreateStack( int MaxSize ): 生成空堆栈,其最大长度为MaxSize; 2、int IsFull( Stack S, int MaxSize ):判断堆栈S是否已满; 3、void Push( Stack S, ElementTy

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

1 participant