性色欲网站人妻丰满中文久久不卡,很黄很污的网站久久mimi色,日产精品久久久久久久

一個簡單的listStack

//#include "stack.h"
2

#pragma once
4

#include <iostream>
5

using namespace std;
7

class Stack
8

{
9

public:
10

Stack(void);
11

virtual ~Stack(void);
12

public:
13

virtual void push (char c) = 0;
14

virtual char pop () = 0;
15

};
16

//#include "ListStack.h"
19

#pragma once
21

#include "stack.h"
22

#include <list>
23

class ListStack :
25

public Stack
26

{
27

friend ostream& operator <<(ostream& out, ListStack &rht);
28

public:
29

ListStack(void);
30

~ListStack(void);
31

public:
33

virtual void push (char c);
34

virtual char pop();
35

public:
37

list<char> m_ls;
39

};
41

//#include "stack.cpp"
44

#include "StdAfx.h"
46

#include "Stack.h"
47

Stack::Stack(void)
49

{
50

}
51

Stack::~Stack(void)
53

{
54

}
55

// #include "ListStack.h"
58

#include "StdAfx.h"
61

#include "ListStack.h"
62

#include <iterator>
63

#include <list>
64

ListStack::ListStack(void)
65

{
66

}
67

ListStack::~ListStack(void)
69

{
70

}
71

void ListStack::push(char c)
73

{
74

m_ls.push_front(c);
76

}
77

char ListStack::pop()
79

{
80

char c = m_ls.front();
81

m_ls.pop_front();
82

return c;
83

}
85

ostream& operator <<(ostream &out, ListStack &rht)
86

{
87

cout<<"stack element";
88

list<char>::iterator beg = rht.m_ls.begin();
89

list<char>::iterator end = rht.m_ls.end();
90

for(; beg != end; beg -- )
91

out<<rht.pop();
93

return out;
96

}
97

100

101

//main.cpp
102

103

// c++stack.cpp : 定義控制臺應用程序的入口點。
104

//
105

106

#include "stdafx.h"
107

#include "ListStack.h"
108

#include <iterator>
109

110

int _tmain(int argc, _TCHAR* argv[])
111

{
112

113

ListStack liststack;
114

int num = 5;
115

while( num --)
116

{
117

char temp;
118

cout<<"input alphat"<<endl;
119

cin>>temp;
120

liststack.push( temp );
121

}
122

123

//num =5;
124

//cout<<liststack<<endl;
125

//while(num --)
126

//{
127

128

// cout<<liststack.pop();
129

130

//}
131

list<char>::iterator beg = liststack.m_ls.begin();
132

list<char>::iterator end = liststack.m_ls.end();
133

for(; beg != end; ++ beg )
134

//cout<<liststack.pop()<<"　";
135

cout<<*beg <<endl;
136

137

cout<<endl;
138

return 0;
139

}
140

141

142

143

posted on 2010-08-19 19:21 郭龍閱讀(252) 評論(0) 編輯收藏引用

只有注冊用戶登錄后才能發(fā)表評論。
【推薦】100%開源！大型工業(yè)跨平臺軟件C++源碼提供，建模，組態(tài)！



網(wǎng)站導航: 博客園 IT新聞 BlogJava 博問 Chat2DB 管理

glxhyt

常用鏈接

留言簿

隨筆檔案

搜索

最新評論

閱讀排行榜

評論排行榜