代码搜索：MyStack
找到约 249 项符合「MyStack」的源代码
代码结果 249
www.eeworm.com/read/442994/7639789
h mystack.h
#pragma once
// 基于 C语言 实现的顺序栈
#include //内存分配 头文件
#include
#include // 抛异常的头文件 是runtime_error 的
//#include
template
class MyStack{
www.eeworm.com/read/399920/7822031
h mystack.h
// myStack.h; Header file
#ifndef H_StackType
#define H_StackType
#include
#include
using namespace std;
template
class stackType
{
public:
const
www.eeworm.com/read/399920/7822035
h mystack.h
// myStack.h; Header file
#ifndef H_StackType
#define H_StackType
#include
#include
using namespace std;
template
class stackType
{
public:
const
www.eeworm.com/read/399920/7822040
h mystack.h
// myStack.h; Header file
#ifndef H_StackType
#define H_StackType
#include
#include
using namespace std;
template
class stackType
{
public:
const
www.eeworm.com/read/399920/7822067
h mystack.h
// myStack.h; Header file
#ifndef H_StackType
#define H_StackType
#include
#include
using namespace std;
template
class stackType
{
public:
const
www.eeworm.com/read/399920/7822264
h mystack.h
// myStack.h; Header file
#ifndef H_StackType
#define H_StackType
#include
#include
using namespace std;
template
class stackType
{
public:
const
www.eeworm.com/read/397008/8072535
java mystack.java
package exec.day0911;
/**
* 写一个类用来模拟栈这种数据结构，要求底层使用数组存储数据，
* 并给出相应的进栈和出栈的方法
* @author Administrator
*
*/
public class MyStack {
int arr[];
int count;
public MyStack(int size){
arr
www.eeworm.com/read/196478/8089347
java mystack.java
/**
* MyStack.java
* @version 1.0.0
* @Hao Chen
*0236407
*/
/**
* An implementation of the Stack ADT.
* In this implementation, we do not grow the stack
* once it is full. A better
www.eeworm.com/read/196477/8089395
java mystack.java
public class MyStack
{
/**
* Creates a new stack that can hold 1000 elements
*
*/
Object[] mystack;
int Capacity = 0;
int max = 1000;
int size;
public MyStack ( )
{
mysta
www.eeworm.com/read/239076/13303735