代码搜索：Stack
找到约 10,000 项符合「Stack」的源代码
代码结果 10,000
www.eeworm.com/read/404326/11487466
h stack.h
/*********************************************************************************
* stack.h
* 定义栈类，用于三种算法的close表以及深度优先搜索的open表
*******************************************************************
www.eeworm.com/read/404204/11490383
s stack.s
;/****************************************Copyright (c)**************************************************
;** 广州周立功单片机发展有限公司
;** 研
www.eeworm.com/read/404204/11490401
o stack.o
www.eeworm.com/read/403950/11496799
h stack.h
// ============================================================================
// Data Structures For Game Programmers
// Ron Penton
// Stack.h
// This file holds the two stack implementations.
www.eeworm.com/read/403950/11497400
h stack.h
// ============================================================================
// Data Structures For Game Programmers
// Ron Penton
// Stack.h
// This file holds the two stack implementations.
www.eeworm.com/read/403950/11497438
h stack.h
// ============================================================================
// Data Structures For Game Programmers
// Ron Penton
// Stack.h
// This file holds the two stack implementations.
www.eeworm.com/read/403950/11497452
h stack.h
// ============================================================================
// Data Structures For Game Programmers
// Ron Penton
// Stack.h
// This file holds the two stack implementations.
www.eeworm.com/read/403946/11497863
h stack.h
// ============================================================================
// Data Structures For Game Programmers
// Ron Penton
// Stack.h
// This file holds the two stack implementations.
www.eeworm.com/read/403154/11521398
cpp stack.cpp
#include "Stack.h"
template
Stack::Stack()
{
top = -1;
}
template
T Stack::GetTop() const
{
if (top == -1)
throw "下溢";
return data[top];
}
template
www.eeworm.com/read/403154/11521404
h stack.h
#ifndef STACK_H
#define STACK_H
#define STACK_MAX_SIZE 100
template
class Stack
{
public:
Stack();
T GetTop() const;
T Pop();
void Push(T x);
private:
T data[STACK_MAX_S