代码搜索：MyStack
找到约 249 项符合「MyStack」的源代码
代码结果 249
www.eeworm.com/read/242043/13097739
cpp huiweng.cpp
#include
#include
#include
#include "LinQueue.h"
#include "LinStack.h"
void HuiWen(char str[])
{
LinStack myStack;
LinQueue myQueue;
i
www.eeworm.com/read/242043/13097758
cpp exam3-3.cpp
#include
#include
#include
#include "LinQueue.h"
#include "LinStack.h"
void HuiWen(char str[])
//判断字符串str是否是回文
{
LinStack myStack;
LinQueue
www.eeworm.com/read/242043/13097761
cpp linstack.cpp
#include
#include
#include "LinStack.h"
void main(void)
{
LinStack myStack;
int test[] = {1,3,5,7,9};
int n = 5;
for(int i = 0; i < n; i++)
www.eeworm.com/read/242043/13097820
cpp exam3-2.cpp
#include
#include
#include
const MaxStackSize = 100;
typedef char DataType;
#include "SeqStack.h"
void ExpIsCorrect(char exp[], int n)
//判断有n个字符的字符串exp左右括
www.eeworm.com/read/242043/13097824
cpp seqstacktest.cpp
#include
#include
const int MaxStackSize = 100; //定义问题要求的元素数目的最大值
typedef int DataType; //定义具体问题元素的数据类型
#include "SeqStack.h"
void main(void)
{
SeqStack myStack
www.eeworm.com/read/240900/13188212
java teststack.java
import java.util.*;
class TestStack
{ public static void main(String args[])
{ Stack mystack=new Stack(); mystack.push(new String("start"));
mystack.push(new String("one")); mystack.
www.eeworm.com/read/324562/13257939
java examstack.java
public class ExamStack{
public static void huiWen(StringBuffer str) throws Exception{
int n = str.length();
SeqStack myStack = new SeqStack(n);
for(int i = 0; i < n; i ++){
myStack.p
www.eeworm.com/read/324562/13257950
bak linstacktest.java.bak
public class LinStackTest{
public static void main(String[] args){
LinStack myStack = new LinStack();
int test[] = {2, 4, 6, 8, 10};
int n=5;
try{
for(int i = 0; i < n;
www.eeworm.com/read/324562/13257953
java linstacktest.java
public class LinStackTest{
public static void main(String[] args){
LinStack myStack = new LinStack();
int test[] = {2, 4, 6, 8, 10};
int n=5;
try{
for(int i = 0; i < n;
www.eeworm.com/read/324562/13257974
bak examstack.java.bak
public class ExamStack{
public static void huiWen(StringBuffer str) throws Exception{
int n = str.length();
SeqStack myStack = new SeqStack(n);
for(int i = 0; i < n; i ++){
myStack.p