栈的实现

最新推荐文章于 2022-02-23 15:02:25 发布

dskit

最新推荐文章于 2022-02-23 15:02:25 发布

阅读量581

点赞数

文章标签： struct border null function float c

版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。

本文链接：https://blog.csdn.net/dskit/article/details/5004437

版权

.h

```
#ifndef __STACK_H
```
```
#define __STACK_H
```
```
/*array stack*/
```
```
namespace dskit
```
```
{
```
```
    struct StackRecord;
```
```
    typedef struct StackRecord* Stack;
```
```
    
```
```
    #ifndef NULL
```
```
    #define NULL (0)
```
```
    #endif
```
```
    typedef char ElementType;
```
```
    typedef unsigned size_t; 
```
```
    
```
```
    bool IsEmpty(Stack s);
```
```
    bool IsFull(Stack s);
```

    Stack CreateStack(size_t MaxElements);

```
    void DisposeStack(Stack s);
```
```
    bool Push(ElementType x, Stack s);
```
```
    ElementType Pop(Stack s);
```
```
    ElementType Top(Stack s);
```
```
    #define EmptyTOS (-1)
```
```
    #define MinStackSize (5)
```
```
    struct StackRecord
```
```
    {
```
```
        int Capacity;
```
```
        int TopOfStack;
```
```
        ElementType* Array;
```
```
    };
```
```
}
```
```
#endif
```

<script language="javascript"> function CopyCode(key){var codeElement=null;var trElements=document.all.tags("ol");var i;for(i=0;i

.cpp

```
#include "stack.h"
```
```
#include 
     
     

     
     
```
```
#include 
     
     

     
     
```
```
bool dskit::IsEmpty(Stack s)
```
```
{
```
```
    return s->TopOfStack == EmptyTOS;
```
```
}
```
```
bool dskit::IsFull(Stack s)
```
```
{
```

    return s->TopOfStack == s->Capacity;

```
}
```

dskit::Stack dskit::CreateStack(size_t MaxElements)

```
{
```
```
    if(MaxElements < MinStackSize)
```
```
        MaxElements = MinStackSize;
```
```
    
```
```
    Stack S;
```
```
    
```

    S = (struct StackRecord*)malloc(sizeof(struct StackRecord));

```
    if(NULL == S)
```
```
        return NULL;
```

    S->Array = (ElementType*) malloc(sizeof(ElementType) * MaxElements );

```
    if(NULL == S->Array)
```
```
    {
```
```
        free(S);
```
```
        return NULL;
```
```
    }
```
```
    S->Capacity = MaxElements;
```
```
    S->TopOfStack = EmptyTOS;
```
```
    return S;
```
```
}
```
```
void dskit::DisposeStack(Stack s)
```
```
{
```
```
    if(NULL != s)
```
```
    {
```
```
        free(s->Array);
```
```
        free(s);
```
```
    }
```
```
}
```

bool dskit::Push(ElementType x, Stack s)

```
{
```
```
    if(IsFull(s))
```
```
        return false;
```
```
    else
```
```
    {
```
```
        printf("%c was pushed./n", x);
```

        return s->Array[++s->TopOfStack] = x;

```
    }
```
```
        
```
```
}
```
```
dskit::ElementType dskit::Pop(Stack s)
```
```
{
```
```
    if(!IsEmpty(s))
```

        return s->Array[s->TopOfStack--];

```
    else
```
```
    {
```
```
        printf("Pop error/n");
```
```
        exit(-1);
```
```
    }
```
```
}
```
```
dskit::ElementType dskit::Top(Stack s)
```
```
{
```
```
    if(!IsEmpty(s))
```

        return s->Array[s->TopOfStack];

```
    else
```
```
    {
```
```
        printf("Top error/n");
```
```
        exit(-1);
```
```
    }
```
```
}
```
```
/*
```
```
int main(int argc, char* argv[])
```
```
{
```

    dskit::Stack s = dskit::CreateStack(50);

```
    dskit::Push(12, s);
```
```
    dskit::Push(13, s);
```
```
    dskit::Push(14, s);
```
```
    
```

    std::cout << dskit::Pop(s) << '/t' << std::endl;

    std::cout << dskit::Pop(s) << '/t' << std::endl;

    std::cout << dskit::Pop(s) << '/t' << std::endl;

```
    dskit::DisposeStack(s);
```
```
}
```
```
*/
```

<script language="javascript"> function CopyCode(key){var codeElement=null;var trElements=document.all.tags("ol");var i;for(i=0;i

关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
栈的实现

隐藏行号复制代码？ .h #ifndef __STACK_H#define __STACK_H/*array stack*/namespace dskit{ struct StackRecord; typedef struct StackRecord* Stack; #ifndef NULL
复制链接

扫一扫

dskit CSDN认证博客专家 CSDN认证企业博客

码龄16年

33: 原创

110万+: 周排名

88万+: 总排名

3万+: 访问

: 等级

916: 积分

40: 粉丝

3: 获赞

8: 评论

9: 收藏

私信

关注

热门文章

分类专栏

最新评论

一年中的第n天是几月几号？
泰戈尔: public String getMonthAndDay(int year, int days) { if (year < 1970 || year > 5000 || days < 0 || ((days > 366) && (isLeapYear(year) == 1))) return "查询年份超过预算！"; int isLeapYear = isLeapYear(year); int[][] details = { { 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 }, { 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 } }; int originalDays = days; // 取值为-1的艺术哦！！！ int month = -1; int day = days; for (int index = 0; days > details[isLeapYear][index]; index++) { days -= details[isLeapYear][index]; month = index; day = days; } // month+2 是因为最后执行了++index操作 return year + "的第" + originalDays + " 天是该年份的" + (month + 2) + "月" + day + "日！"; }
一年中的第n天是几月几号？
泰戈尔: 看了博主的这篇文章，稍稍加了点改进。感谢博主的优雅实现。 ------------------------------------------------------------------------------- /** * @Date 2017年3月2日 * * @author 郭璞 * */ package interview; /** * @author 郭璞 * * 求某一年的第N天是本年的几月几号 * */ public class DayNisWhen { /** * 判断year是否为闰年 * * @param year * @return 1代表是，0代表不是 */ public int isLeapYear(int year) { return (year % 4 == 0 && year % 100 != 0) || (year % 400 == 0) ? 1 : 0; } public static void main(String[] args) { DayNisWhen obj = new DayNisWhen(); String result = obj.getMonthAndDay(2017, 61); System.out.println(result); } }
并查集及其应用
zhaoduoling: 谢谢！
windows python2.6 django 开发环境搭建
dskit: 陆续有同学发邮件问我win7下安装mod_python出问题的处理方法，之前碰到过没有将处理方法记录下来。今天把Apache删除了重新安装了一次，现在将安装方法简单记录下： 1. 安装过程中出错没有关系，安装目的其实就是将mod_python.so复制到Apache的安装目录下
动态规划(Dynamic programming)--算法
Fallinline: [e01]

您愿意向朋友推荐“博客详情页”吗？

强烈不推荐
不推荐
一般般
推荐
强烈推荐

提交

最新文章

目录

评论

被折叠的条评论为什么被折叠?

到【灌水乐园】发言

查看更多评论

添加红包

成就一亿技术人!

hope_wisdom

发出的红包

实付元

使用余额支付

点击重新获取

扫码支付

钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。