数据结构课作业系列

 

 

　　数据结构课作业-----顺序表

/****************************

程序名称：简单电话号码查询系统 V.0.1
主要功能：简单联系人录入，查找，排序.....
主要结构：静态数组类链表

  **************************/

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define N 1005

//主要结构
struct Person
{
    char name[25];
    char telp[15];
};
FILE * fp;

//主要类
class Phone
{
    public:
        //自定义构造函数
        Phone ():mySize(10)
        {
            memset (people, 0, sizeof people);
        }
        //创建函数
        void Creat (int n)
        {
            mySize = n;
            memset (people, 0, sizeof people);
        }
        //按姓名查找 or 按电话号查找 or 按位置查找
        void Find(int flag) const;
        //按位置插入信息
        void Insert (Person p, int pos);
        //按位置修改信息
        void Revamp (Person p, int pos);
        //全部显示
        void Display (bool flag) const;
        //按位置删除
        void Delete (int pos);
        //按姓名排序  or  按电话号码排序
        void Sort (int flag);
    private:
        int mySize;
        Person people[N];
};

bool cmp (const Person &a, const Person &b)
{
    return strcmp (a.telp, b.telp) < 0 ? 1 : 0;
}
bool cmp1 (const Person &a, const Person &b)
{
    return strcmp (a.telp, b.telp) > 0 ? 1 : 0;
}

void Phone::Delete (int pos)
{
    if (mySize==0 || pos>mySize || pos<1)
    {
        cout << "电话本为空 or 位置不存在,无法删除\n";
        return;
    }
    for (int i=pos; i<mySize; i++)
        people[i] = people[i+1];
}

void Phone::Sort (int flag)
{
    if (flag == 1)
        sort (people, people+mySize, cmp1);
    else
        sort (people, people+mySize, cmp);
}

void Phone::Revamp (Person p, int pos)
{
    if (pos<1 || pos>mySize)
    {
        cout << "位置不存在\n";
        return;
    }
    if (mySize == 0)
    {
        cout << "电话本为空\n";
        return;
    }
    if (strlen(people[pos].name)==0 || strlen (people[pos].telp)==0)
    {
        cout << "该处没有信息科修改\n";
        return;
    }
    people[pos] = p;
}

void Phone::Find (int flag) const
{
    char tmp[25];
    int pos;
    cout << "输入要查找的信息:  "; 
    if (flag < 3)
        cin >> tmp;
    else
        cin >> pos;

    bool tag = true;
    int i;
    for (i=0; i<mySize; i++)
    {
        if (flag == 1 && strcmp (tmp, this->people[i].name)==0)
        {
            tag = false;break;
        }
        else if (flag == 2 && strcmp (tmp, this->people[i].telp)==0)
        {
            tag = false;break;
        }
        else if (flag == 3 && (pos>1 && pos<mySize && mySize))
        {
            tag = false; i = pos; break;
        }
    }
    if (tag)
        cout << "Sorry，你要查找的信息不存在\n";
    else
    {
        cout << "    你要查找的信息如下:\n";
        cout << "    姓名: " << this->people[i].name << endl;
        cout << "    号码: " << this->people[i].telp << endl;
    }
}

void Phone::Display (bool flag) const
{
    if (mySize == 0)
    {
        cout << "    电话号码为空\n";
        return;
    }

    cout << "    电话本大小： " << mySize<<endl;
    cout << "    电话本存有如下信息：\n";
    for (int i=1; i<=mySize; i++)
    {
        if (strlen(people[i].name) && !flag) 
            cout << "姓名: " << people[i].name << "  号码: " <<people[i].telp << endl;
        else if (strlen(people[i].name) && flag)
        {
            fp = fopen ("phone.txt","w");
            fprintf (fp,"姓名: %s  号码: %s\n",people[i].name,people[i].telp);
        }
    }
    cout << "\n";
}

void Phone::Insert (Person p, int pos)
{
    if (mySize == N)
    {
        cout << "内存已满，无法插入\n";
        return;
    }
    if (pos<1 || pos>mySize)
    {
        cout << "试图插入的位置非法\n";
        return;
    }

    for (int i=mySize; i>pos; i--)
        people[i] = people[i-1];
    people[pos] = p;
    mySize++;
}

//菜单函数
void Meue ()
{
      cout << "\n\n"
         << "    ************************************\n"
         << "        欢迎使用简单电话查询系统      \n"
          << "        1.创建一个 n 容量的电话本    \n"
         << "        2.添加联系人            \n"
           << "        3.修改联系人            \n"
         << "        4.查找联系人            \n"
         << "        5.显示联系人            \n"
              << "         6.排序联系人            \n"
         << "        7.写入到文件            \n"
         << "        8.删除联系人            \n"
         << "         0.退出                \n";
      cout << "     ************************************\n";
}

void FuncCreat (Phone &p)
{
    int n;
    cout << "输入电话本的大小( n 最大为1000): "; while (cin>>n, n>1000)cout << "** 重输 **\n";
    p.Creat (n);
}

void FuncAdd (Phone &p)
{
    int n, pos;
    Person tmp;
    cout << "输入要添加的个数："; cin >> n;
    for (int i=1; i<=n; i++)
    {
        cout << "输入第 " <<i<<" 个联系人的插入位置，姓名和电话："; cin>>pos>>tmp.name>>tmp.telp;
        p.Insert(tmp, pos);
    }
}

void FuncRevamp (Phone &p)
{
    int pos, n;
    Person tmp;
    cout << "输入要修改的个数： ";cin>>n;
    for (int i=1; i<=n; i++)
    {
        cout << "输入要修改的位置： ";cin>>pos;
        cout << "输入要修改的信息(姓名+号码):  ";cin>>tmp.name>>tmp.telp;
        p.Revamp (tmp, pos);
    }
}

void FuncFind (Phone &p)
{
    int n;
    cout << " ******************* \n"
         << " 1.按姓名查找        \n"
         << " 2.按号码查找        \n"
         << " 3.按位置查找        \n";
    cout << " ******************* \n";

    cout << " 输入查找方式： "; while (cin>>n, n!=1&&n!=2&&n!=3)cout<<"**重输**\n";
    
    p.Find (n);
}

void FuncSort (Phone &p)
{
    int n;
    cout  << " ***************** \n"
        << " 1.按号码增序排    \n"
        << " 2.按号码降序排    \n";
    cout << " ****************** \n";

    cout << "输入排序方式： "; while (cin>>n, n!=1&&n!=2)cout<<"**重输**\n";

    p.Sort (n);
}

void FuncDelete (Phone &p)
{
    int pos;
    cout << "输入要删除的位置：";cin>>pos;
    p.Delete (pos);
}
//操作函数
void Operator (Phone &p)
{
    int op;
    while (1)
    {
        cout << "输入要进行的操作:\n";
        cin >> op;
        if (op == 1)  FuncCreat(p);
        else if (op == 2) FuncAdd (p);
        else if (op == 3) FuncRevamp (p);
        else if (op == 4)    FuncFind (p);
        else if (op == 5) p.Display (0);
        else if (op == 6)    FuncSort (p);
        else if (op == 7) p.Display (1);
        else if (op == 8) FuncDelete (p);
        if (op==0)    break;
    }
}

/************  测试函数 *************/

int main ()
{

    Phone p;

    Meue ();

    Operator (p);
    
    return 0;
}

 

　　数据结构课祖业------括号匹配检查

#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
using namespace std;

#define Max 1005

typedef char StackItem;

class Stack
{
    public:
        Stack ():myTop(-1) {}
        bool empty () const { return myTop == -1; }
        void push (StackItem item);
        void pop ();
        StackItem top () const;
    private:
        StackItem myArray[Max];
        int myTop;
};

StackItem Stack::top () const
{
    if (myTop == -1) return -1;
    return myArray[myTop];
}

void Stack::push (StackItem item)
{
    if (myTop == Max)
    {
        cout << "栈已满,请删除后再入栈!\n";
        return;
    }
    myArray[++myTop] = item;
}

void Stack::pop ()
{
    if (myTop==-1)
        return;
    myTop--;
}

int main ()
{
    Stack opt;
    while (1)
    {
        cout << " ***请输入要检查的括号:  ";
        StackItem braket[Max];
        bool error = false;
        gets (braket);
        for (int i=0; braket[i]; i++)
        {
            if (error) continue;

            if (braket[i]=='(' || braket[i]=='[' || braket[i]=='{')
                opt.push (braket[i]);
            else
            {
                StackItem tmp = opt.top ();
                if (tmp==-1) {error = true; continue;}
                if (tmp=='(' && braket[i]==')')
                {
                    opt.pop ();
                    continue;
                }
                if (tmp=='[' && braket[i]==']')
                {
                    opt.pop ();
                    continue;
                }
                if (tmp=='{' && braket[i]=='}')
                {
                    opt.pop ();
                    continue;
                }
                error = true;
            }
        }
        if (error)
            cout << " --括号不匹配--\n";
        else
            cout << " --括号匹配正确--\n";
    }
    return 0;
}

 

　　数据结构课作业------运算表达式求值

#include <cstdio>
#include <iostream>
#include <cstring>
#include <string>
using namespace std;

#define Max 1005

template <typename T>
class Stack
{
    public:
        Stack ():myTop(-1) { memset (myArray, 0, sizeof myArray); }
        bool empty () const { return myTop == -1; }
        void push (T item);
        void pop ();
        T top () const;
    private:
        T myArray[Max];
        int myTop;
};
char tmp[25];

template <typename T> void Stack <T>::push (T item)
{
    if (myTop==Max) return;
    myArray[++myTop] = item;
}

template <typename T> void Stack <T>::pop ()
{
    if (myTop == -1) return;
    myTop--;
}

template <typename T> T Stack <T>::top () const
{
    if (myTop == -1) return -1;
    return myArray[myTop];
}

char OptrRelation[7][7] = 
{
      {'>', '>', '<', '<', '<', '>', '>'},  
      {'>', '>', '<', '<', '<', '>', '>'},  
      {'>', '>', '>', '>', '<', '>', '>'},  
      {'>', '>', '>', '>', '<', '>', '>'},  
      {'<', '<', '<', '<', '<', '=', ' '},  
      {'>', '>', '>', '>', ' ', '>', '>'},  
      {'<', '<', '<', '<', '<', ' ', '='}
};

int Postion_Optr (char optr)
{
    switch (optr)
    {
        case '+':return 0;
        case '-':return 1;
        case '*':return 2;
        case '/':return 3;
        case '(':return 4;
        case ')':return 5;
        case '#':return 6;
    }
}

char Precede (char s1, char s2)
{
    int coord_1 = Postion_Optr(s1);
    int coord_2 = Postion_Optr(s2);

    return OptrRelation[coord_1][coord_2];
}

int Opera (int a, char op, int b)
{
    if (op=='-') return a-b;
    if (op=='+') return a+b;
    if (op=='*') return a*b;
    if (op=='/') return a/b;
}

int Expression (string exp)
{
    Stack <char> Operator;
    Stack <int> Number;

    int i=0;
    exp += "#";
    Operator.push ('#');
    
    char ch = exp[i++];
    while (ch!='#' || Operator.top()!='#')
    {
        if (ch>='0' && ch<='9')
        {
            int k=0, a=0;
            while (ch<='9' && ch>='0')
            {
                tmp[k++] = ch;
                ch = exp[i++];
            }
            tmp[k] = '\0';
            sscanf (tmp, "%d", &a);
            Number.push (a);
        }
        else
        {
            switch (Precede (Operator.top(), ch))
            {
                case '<':
                    Operator.push (ch);
                           ch = exp[i++];
                    break;
                case '=':
                    Operator.pop ();
                           ch = exp[i++];
                    break;
                case '>':
                    char opt = Operator.top ();
                    Operator.pop();
                    int A = Number.top ();
                    Number.pop();
                    int B = Number.top ();
                    Number.pop();
                    Number.push (Opera (B, opt, A));
                    break;
            }
        }
    
    }
    return Number.top();
}

int main()
{
    string exp;
    while (1)
    {
        cout << "*** 请输入一个表达式 ***\n"
            "注意：以'#'结尾且中间不得有多余的空格 ：\n";cin >> exp;

        int ans = Expression (exp);

        printf ("%d\n",ans);
    }
    return 0;
}

 

　　数据结构课作业-----链式表。

#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;

struct Node
{
    char name[30];
    char telp[30];
    Node * next;
};

class Stulist
{
    public :
        Stulist ();
        ~Stulist ();

        void Creat (int n);   //建立n个元素的链式表

        void Insert (Node item, int pos);//按位置插入元素item

        void Find (int pos) const; //按位置查找

        void Delete (int pos); //按位置删除

        void Print () const;  //打印所有数据
 
        void Clear ();   //清空链式表
    private :
        Node * first;
};

void Stulist :: Clear ()
{
    Node * Pre = first;
    while (Pre)
    {
        memset (Pre->name, 0, sizeof Pre->name);
        memset (Pre->telp, 0, sizeof Pre->telp);
        Pre = Pre->next;
    }
}

void Stulist :: Print () const
{
    Node * Pre = first->next;
    int cnt=1;
    cout << "******************************\n";
    while (Pre)
    {
        cout <<"    "<< cnt <<".  "<< Pre->name << "   " << Pre->telp << endl;
        Pre = Pre->next;
        cnt++;
    }
    cout << "******************************\n";
}

void Stulist :: Delete (int pos)
{
    Node * Pre = first;
    int cnt=0;
    cout << "请输入要删除的位置: "; cin >> pos;
    while (Pre && cnt<pos-1)
    {
        Pre = Pre->next;
        cnt++;
    }
    if (Pre==NULL)
    {
        cout << "试图删除非法位置!\n";
        return;
    }
    Pre->next = Pre->next->next;
    cout << "以成功删除第" << pos << " 个数据.\n";
}

void Stulist :: Find (int pos) const
{
    Node * Pre = first;
    int cnt=0;
    cout << "请输入要查找的位置: "; cin >> pos;
    while (Pre && cnt<pos)
    {
        Pre = Pre->next;
        cnt++;
    }
    if (Pre==NULL)
    {
        cout << "你要查找的数据不存在，请核对后再查找!\n";
        return;
    }
    cout << "你要查找的信息详细如下：\n";
    cout << "************************\n";
    cout << " 姓名："<< Pre->name <<endl;
    cout << " 号码："<< Pre->telp <<endl;
    cout << "************************\n";
}

void Stulist::Insert (Node item, int pos)
{
    Node * Pre=first, * Cur;
    cout << "请输入要插入的位置: "; cin >> pos;
    int cnt=0;
    while (Pre && cnt < pos-1)
    {
        Pre = Pre->next;
        cnt++;
    }
    if (Pre==NULL)
    {
        cout << "试图插入非法位置!\n";
        return;
    }
    cout << "请出入要插入的姓名："; cin >> item.name;
    cout << "请出入要插入的号码："; cin >> item.telp;
    Cur = new Node;
    strcpy (Cur->name, item.name);
    strcpy (Cur->telp, item.telp);
    Cur->next = Pre->next;
    Pre->next = Cur;
    cout << "插入成功！\n";
}

Stulist::Stulist ()
{
    first = new Node;
    first->next = NULL;
}

Stulist :: ~Stulist ()
{
    Node * pre = first;
    while (first)
    {
        pre = first;
        first = pre->next;
        delete pre;
    }
}
void Stulist::Creat (int n)
{
    Node *Pre, *Cur;
    first = new Node;
    Pre = first;
    cout << "请输入要建立表的大小: "; cin >> n;
    for (int i=0; i<n; i++)
    {
        Cur = new Node;
        cout << "请输入第 " << i+1 << " 个数据："; cin >> Cur->name >> Cur->telp;
        Pre->next = Cur;
        Pre = Cur;
    }
    Pre->next = NULL;
}

void Meue ()
{
    cout<<" \n ~~~~~~~~~~~~~~请选择您要执行的操作：~~~~~~~~~~~~~~\n"; 
    cout<<endl<<endl; 
    cout<<" `````````````````````````````````````````````\n"; 
    cout<<" ` 1、清空顺序表 `\n"; 
    cout<<" ` 2、创建顺序表 `\n"; 
    cout<<" ` 3、插入信息 `\n"; 
    cout<<" ` 4、删除信息 `\n"; 
    cout<<" ` 5、查找信息 `\n"; 
    cout<<" ` 6、显示当前信息 `\n"; 
    cout<<" ` 0、退出系统 `\n"; 
    cout<<" `````````````````````````````````````````````\n"; 
    cout<<"\n请从序号0--6中选择:"; 
}

void Operater (Stulist &Link)
{
    Meue ();
    int op, pos, n;
    Node item;
    while (1)
    {
        while (cin >> op, (op<0||op>6)) cout << "操作不合法:    \n";
        switch (op)
        {
            case 1:
                Link.Clear (); break;
            case 2:
                Link.Creat (n); break;
            case 3:
                Link.Insert (item, pos); break;
            case 4:
                Link.Delete (pos); break;
            case 5:
                Link.Find (pos); break;
            case 6:
                Link.Print (); break;
            default:break;
        }
    }
    cout << "~~~~~~~~~欢迎下次使用~~~~~~~~~\n";
}


//***************         主程序         **************
int main ()
{
    Stulist Link;

    Operater (Link);

    return 0;
}

 

　　数据结构课作业------迷宫求解。

测试数据：

9 6
....#.
.....#
......
......
......
......
......
#....#
.#..#.
9 11
.#.........
.#.#######.
.#.#.....#.
.#.#.###.#.
.#.#...#.#.
.#.#####.#.
.#.......#.
.#########.
...........
6 11
..#.....#..
..#..#..#..
..#..#..###
..#..#..#..
..#..#..#..
.....#.....
7 7
..#.#..
..#.#..
#.#.###
.......
###.###
..#.#..
..#....

#include <cstdio>
#include <queue>
#include <cstring>
using namespace std;
#define N 105
struct Pos
{
    int x, y;
    int step;
}path[N][N];
char map[N][N];
bool used[N][N];
int dir[][2]={1,0, -1,0, 0,1, 0,-1};
int n, m, ans;

bool judge (Pos a)
{
    if (a.x<0||a.x>n-1 || a.y<0||a.y>m-1 || used[a.x][a.y] || map[a.x][a.y]=='#')
        return false;
    return true;
}

int bfs ()
{
    Pos Pre, Cur;
    queue <Pos> Q;
    while (!Q.empty ()) Q.pop();
    memset (used, 0, sizeof used);

    used[n-1][m-1] = true;
    Pre.x = n-1;
    Pre.y = m-1;
    Pre.step = 0;

    Q.push (Pre);
    while (!Q.empty ())
    {
        Pre = Q.front ();
        
        Q.pop();
        for (int i=0;i<4; i++)
        {
            Cur = Pre;
            Cur.x += dir[i][0];
            Cur.y += dir[i][1];
            Cur.step += 1;
            if (judge (Cur))
            {
                used[Cur.x][Cur.y] = true;
                path[Cur.x][Cur.y].x = Pre.x;
                path[Cur.x][Cur.y].y = Pre.y;
                Q.push (Cur);
                if (Cur.x==0 && Cur.y==0)
                    return Cur.step;
            }
        }
    }
    return -1;
}

void PrintRoad ()
{
    queue <Pos> Q;
    while (!Q.empty ()) Q.pop();
    int x1=0, y1=0, t=1;
    int x2, y2;
    Pos Pre;
    Pre.x = x1; Pre.y=y1;
    Q.push (Pre);
    while (1)
    {
        x2 = x1;
        y2 = y1;
        Q.push (path[x2][y2]);
        x1 = path[x2][y2].x;
        y1 = path[x2][y2].y;
        if (x1==n-1 && y1==m-1) break;
    }

    while (!Q.empty ())
    {
        Pre = Q.front ();
        Q.pop();
        printf ("第 %d 歩：(%d, %d) -> (%d, %d)\n",t++, Pre.x,Pre.y,path[Pre.x][Pre.y].x,path[Pre.x][Pre.y].y);
        if (t-1==ans) break;
    }
}
int main ()
{
    printf ("``请输入迷宫的大小，其中 '#' 表示墙不可以通过，'.' 表示道路可以通过：\n");
//    freopen("test","r",stdin);
    while (~scanf ("%d%d",&n,&m))
    {
        for (int i=0; i<n; i++)
            for (int j=0; j<m; j++)
                scanf (" %c",map[i]+j);
        ans = bfs ();
        if (ans!=-1)
        {
            printf ("``走出迷宫最少需要花费 %d 分钟，路程如下：\n",ans);
            PrintRoad ();
        }
        else
            puts ("```````你无法走出迷宫了.````````");
    }
    return 0;
}