代码搜索：Stack
找到约 10,000 项符合「Stack」的源代码
代码结果 10,000
www.eeworm.com/read/232901/14178359
s stack.s
;/****************************************Copyright (c)**************************************************
;** 广州周立功单片机发展有限公司
;** 研
www.eeworm.com/read/130686/14178849
zip stack.zip
www.eeworm.com/read/130550/14187163
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/129928/14216590
h stack.h
/************************************************************
Title: Operator-Precedence Parsing
Author: Dake Song, Class 0201 of Computer Science
Date: Mar.18 of 2005
*********
www.eeworm.com/read/129636/14235146
m stack.m
function ST=stack(v)
% 调用格式
% ST=stack 创建一个"空"堆栈对象.
% ST=stack(v) 创建包含变量v的堆栈对象。
if nargin>1;error('Too many arguments.');end;
if nargin==0 % 没有输入宗量情况
Q=queue;
s.value=[];
www.eeworm.com/read/129191/14258866
class stack.class
www.eeworm.com/read/129131/14263424
java stack.java
public class Stack {
private java.util.ArrayList pool = new java.util.ArrayList();
public Stack() {
}
public Stack(int n) {
pool.ensureCapacity(n);
}
public void
www.eeworm.com/read/129125/14264331
java stack.java
public class Stack
{
private Node top;
public Stack()
{
top = null;
}
public void push(Object obj)
{
Node node = new Node(obj);
node.next
www.eeworm.com/read/129125/14264344
class stack.class
www.eeworm.com/read/129125/14264351
java stack.java
public class Stack
{
private Node top;
public Stack()
{
top = null;
}
public void push(Object obj)
{
Node node = new Node(obj);
node.next