代码搜索:LinkStack
找到约 226 项符合「LinkStack」的源代码
代码结果 226
www.eeworm.com/read/151911/12161986
cpp linkstack.cpp
//LinkStack.cpp
#include "LinkStack.h"
/*
* 前置条件:栈不存在
* 输 入:无
* 功 能:栈的初始化
* 输 出:无
* 后置条件:构造一个空栈
*/
template
LinkStack::LinkStack( )
{
top=NULL;
}
/*
*
www.eeworm.com/read/151911/12161990
dsp linkstack.dsp
# Microsoft Developer Studio Project File - Name="
www.eeworm.com/read/225593/14531762
h linkstack.h
// LinkStack.h: interface for the CLinkStack class.
//
//////////////////////////////////////////////////////////////////////
#if !defined(AFX_LINKSTACK_H__02361A78_ECCB_4820_AC09_E39DC3943922__I
www.eeworm.com/read/225593/14531766
cpp linkstack.cpp
// LinkStack.cpp: implementation of the CLinkStack class.
//
//////////////////////////////////////////////////////////////////////
#include "stdafx.h"
#include "LinkStack.h"
////////////////
www.eeworm.com/read/221217/14753376
h linkstack.h
#include"Stack.h"
template
struct Node
{
T data;
Node *pNext;
};
template
class LinkStack: public Stack
{
private: //属性
Node *m_pTop;
int m_num;
www.eeworm.com/read/116230/14982353
java linkstack.java
/**
* This is the stack class for the program.
* It is made up of the linked list.
* It can do th push, pop, peek operations as the stack requires.
* It is used to store the data of the
www.eeworm.com/read/116216/14982475
cpp linkstack.cpp
#include
typedef char Stack_entry;
typedef Stack_entry Node_entry;
enum error_code{
success,overflow,underflow
};
struct Node{
Node_entry entry;
Node *next;
Node();
www.eeworm.com/read/242824/4534090
dsw linkstack.dsw
Microsoft Developer Studio Workspace File, Format Version 6.00
# WARNING: DO NOT EDIT OR DELETE THIS WORKSPACE FILE!
###############################################################################
www.eeworm.com/read/242824/4534092
h linkstack.h
//LinkStack.h
#ifndef LINKSTACK_H
#define LINKSTACK_H
template
struct Node
{
T data;
Node *next; //此处也可以省略
};
template
class LinkStack
{
public:
www.eeworm.com/read/242824/4534093
cpp linkstack.cpp
//LinkStack.cpp
#include "LinkStack.h"
/*
* 前置条件:栈不存在
* 输 入:无
* 功 能:栈的初始化
* 输 出:无
* 后置条件:构造一个空栈
*/
template
LinkStack::LinkStack( )
{
top=NULL;
}
/*
*