代码搜索：Stack
找到约 10,000 项符合「Stack」的源代码
代码结果 10,000
www.eeworm.com/read/402148/11542124
cpp stack.cpp
// stack.cpp: implementation of the stack class.
//
//////////////////////////////////////////////////////////////////////
#include "stdafx.h"
#include "Tin3D.h"
#include "stack.h"
#ifdef _D
www.eeworm.com/read/401854/11546801
java stack.java
public class Stack implements Simplestack{
int maxSize;
int top;
char [] stack;
final int defualSize=10;
public Stack(){
initiate(defualSize);
}
public Stack(int size){
initi
www.eeworm.com/read/401665/11552026
h stack.h
#include"srcs.h"
typedef int SElemType; /* 栈类型 */
/*栈的顺序存储表示 */
#define STACK_INIT_SIZE 10 /* 存储空间初始分配量 */
#define STACKINCREMENT 2 /* 存储空间分配增量 */
typedef struct SqStack
{
SElemType *b
www.eeworm.com/read/400815/11568187
h stack.h
#ifndef _STACK_H_
#define _STACK_H_
#include "typedefine.h"
#include "constant.h"
typedef ElemType STACK_ELEMENT_TYPE;
typedef struct STACK{
STACK_ELEMENT_TYPE data[MAX_STACK_SIZE];
SIZ
www.eeworm.com/read/400815/11568188
c stack.c
#include "stack.h"
#include
#include
PSTACK CreateStack()
{
PSTACK stack = (PSTACK)malloc(sizeof(STACK));
if(NULL == stack)
{
printf("memory overflow!\n");
exi
www.eeworm.com/read/400552/11574529
c stack.c
#include
#include
#define Max 100
int *p;
int *tos;
int *bos;
/*添加一个数据放到堆栈对顶端*/
void push(int i)
{
if(p > bos)
{
printf("堆栈以满\n");
return;
}
*p = i;
p+
www.eeworm.com/read/262556/11586960
h stack.h
#if !defined(AFX_STACK_H__75314E61_4BBF_11D5_9DFE_5254AB1C303A__INCLUDED_)
#define AFX_STACK_H__75314E61_4BBF_11D5_9DFE_5254AB1C303A__INCLUDED_
#include
template
clas
www.eeworm.com/read/262351/11591466
h stack.h
/*
*
* Copyright (c) 1994
* Hewlett-Packard Company
*
* Permission to use, copy, modify, distribute and sell this software
* and its documentation for any purpose is hereby granted without fee,
www.eeworm.com/read/158370/11622962
h stack.h
// stack.h Definition of the Stack class
const int MAX = 100;
class Stack
{ public: Stack (); // constructor
void Push (int x); // push x onto stack
int Pop (); // pop and retur