C++博客-My road to c++-随笔分类-DataStruct

栈的实现（顺序结构）Alpha 2.0

亦夏 — Mon, 27 Apr 2009 08:33:00 GMT

摘要: /** Stack(use array to implement) Version: 2.0 Member function as follow: Size() Push(T) // inset an elm ... 阅读全文

亦夏 2009-04-27 16:33 发表评论

二查查找树的实现(链式) Alpha1.0

亦夏 — Mon, 23 Mar 2009 16:13:00 GMT

摘要: 1/**//** 2 Binary Search Tree 3 Version: 1.0 4 ... 阅读全文

亦夏 2009-03-24 00:13 发表评论

队列的实现(链式结构) Alpha 1.0

亦夏 — Thu, 19 Mar 2009 18:33:00 GMT

摘要: 1/**//** 2 Queue (Liked structure) 3 Version: 1.0... 阅读全文

亦夏 2009-03-20 02:33 发表评论

队列的实现(数组结构) Alpha 1.0

亦夏 — Thu, 19 Mar 2009 18:18:00 GMT

摘要: 1/**//** 2 Queue 3 Version: 1.0 4 ... 阅读全文

亦夏 2009-03-20 02:18 发表评论

栈的实现（链式结构）Alpha 1.0

亦夏 — Wed, 18 Mar 2009 14:46:00 GMT

摘要: 1/**//** 2 Stack(use linked structure to implement) 3 Version: 1.... 阅读全文

亦夏 2009-03-18 22:46 发表评论

栈的实现（顺序结构）Alpha 1.0

亦夏 — Wed, 18 Mar 2009 14:44:00 GMT

1/**
2        Stack(use array to implement)
3        Version: 1.0
4        Member function as follow:
5        size()
6        push(T)        // inset an elm
7        pop()        // delete the last elm
8        empty()         // if it is an empty list
9        print()
10
11        Use C++ template
12**/
13#include<iostream>
14#include<string>
15
16
17using namespace std;
18#ifndef SQSTACK_H
19#define SQSTACK_H
20
21template<typename T>
22class sqStack
23{
24public:
25    sqStack():top(-1){}
26    ~sqStack(){ top = -1; };
27    bool Empty()const { return top == -1; }
28    void Push(const T&);
29    void Pop(){ assert(top > -1); top--;};
30    void Print() const;
31    int  Size() const { return (top + 1);};
32private:
33    static const int MaxSize = 200;
34    T elem[MaxSize];
35    int top;
36};
37
38template<typename T> void sqStack<T>::Push(const T& one)
39{
40    assert(top <= MaxSize - 1);
41    top++;
42    elem[top] = one;
43}
44
45template<typename T> void sqStack<T>::Print() const
46{
47    for(int i = 0; i < top; i++ )
48    cout << elem[i] << " ";
49    cout << elem[top] << endl;
50}
51
52#endif

//Test Function

1// Test Function
2int main()
3{
4    using namespace std;
5    sqStack<int> stack;
6    cout << "----------------Display the stack program-----------------------" << endl;
7    cout << "\n Initial the stack,please input the number of element to push stack "<< endl;
8    cout << "number = " ;
9    int number;
10    cin >> number;
11    cout << "Secondly input the number in the following\n" << endl;
12    int temp;
13    for( int i = 0; i < number; i++ )
14    {
15        cin >> temp;
16        stack.Push(temp);
17    }
18    cout << "You Input As Follow" << endl;
19    stack.Print();
20    cout << "Would you like to display the pop functionYes or No" << endl;
21    string answer;
22    cin >> answer;
23    if( answer == "yes" || answer == "YES" )
24    {
25        stack.Pop();
26        stack.Print();
27    }
28    cout <<"-----------------------------------------------------------------" << endl;
29    system("pause");
30    return 0;
31
32}
33

亦夏 2009-03-18 22:44 发表评论

循环链表的实现（Alpha）

亦夏 — Tue, 24 Feb 2009 15:16:00 GMT

摘要: 1/**//** 2 Loop List (just like LinkedList) 3 Versio... 阅读全文

亦夏 2009-02-24 23:16 发表评论

双向链表的实现（Alpha1.0 ）

亦夏 — Sun, 22 Feb 2009 13:58:00 GMT

摘要: 1/**//** 2 Double List base on dynamic array 3 ... 阅读全文

亦夏 2009-02-22 21:58 发表评论

单向链表的实现（Alpha 1.0）

亦夏 — Sun, 22 Feb 2009 13:57:00 GMT

摘要: 1/**//** 2 Linked List base on dynamic array 3 ... 阅读全文

亦夏 2009-02-22 21:57 发表评论

线性表的顺序表示和实现（静态数组方式）（Alpha1.0）

亦夏 — Wed, 18 Feb 2009 15:27:00 GMT

摘要: /** Linear List Member function as follow: Size() Insert(T) // inset an elm Delete(T) ... 阅读全文

亦夏 2009-02-18 23:27 发表评论