数据结构相关代码

/*#include<iostream>
using namespace std;
#define MaxSize 10

typedef struct {
    int age;
    double height;
}Person, *PPerson,Persons[MaxSize];

void printPerson(Person p)
{
    cout << p.age << "," << p.height << endl;
}

int main() {
    //普通变量
    Person p;
    p.age = 10;
    p.height = 17.5;
    printPerson(p);

    //指针
    PPerson pp = &p;//指向p的结构体
    pp->age = 17;
    pp->height = 18.6;
    printPerson(p);
    printPerson(*pp);

    //数组
    Persons ps;
    cout << sizeof(ps) / sizeof(Person) << endl;
    return 0;
}*/

//定义结构体的方式二
/*#include<iostream>
using namespace std;

typedef struct Person {
    char *name;
    int age;
    double height;
    //配偶
    struct Person* mate;
}Person,*PPerson;

void printPerson(Person p)
{
    cout << "姓名" << p.name << ",年龄" << p.age
        <<"身高"<<p.height<< endl;
    cout << "配偶姓名" << p.mate->name
        << "配偶年龄：" << p.mate->age
        << "配偶身高：" << p.mate->height << endl;
    cout << endl;
}

int main()
{
    Person lili, lihua;
    //配偶
    lili.mate = &lihua;
    lihua.mate = &lili;
    //信息
    lili.age = 23;
    lili.height = 1.65;
    lili.name = "lili";

    lihua.age = 25;
    lihua.height = 1.75;
    lihua.name ="lihua";

    printPerson(lili);
    printPerson(lihua);
    return 0;
}*/

/*#include<iostream>
using namespace std;
//方式一：一次性定义出变量
struct {
    int age;
    double height;
}fq,zjl;

int main()
{
    //方式一
    //为结构体属性赋值
    fq.age = 22;
    fq.height = 1.75;
    zjl.age = 46;
    zjl.height = 1.78;

    //访问结构体属性
    cout << fq.age << "," << fq.height << endl;
    cout << zjl.age << "," << zjl.height << endl;
    return 0;
}*/

//方式二
/*#include<iostream>
using namespace std;
struct Person {
    int age;
    double height;
};

int main() {
    //定义变量
    struct Person p;
    p.age = 10;
    p.height = 1.75;
    cout << p.age << "," << p.height << endl;
    return 0;
}*/

//方式三
//typedef define形式
/*#include<iostream>
using namespace std;
#define MaxSize 10

typedef struct {
    int age;
    double height;
}Person,*PPerson,Persons[MaxSize];

void PrintPerson(Person p)
{
    cout << p.age << "," << p.height << endl;
}

int main() {
    //普通变量
    Person p;
    p.age = 10;
    p.height = 175;
    PrintPerson(p);

    //指针
    PPerson pp = &p;//修改属性
    pp->age = 17;
    pp->height = 18.9;
    //PrintPerson(p);
    PrintPerson(*pp);
    return 0;
}*/
//第二种
/*#include<iostream>
using namespace std;
#define MaxSize 200

typedef struct Person {
    char* name;
    int age;
    double height;
    struct Person* mate;
}Person,*PPerson,Person[MaxSize];

void printPerson(Person p)
{
    cout << p->age << "," << p->height << p->mate << endl;
}

int main()
{
    Person lihua, lili;
    lili->mate = &lihua;
    lihua->mate = &lili;


    return 0;
}*/


//#include<iostream>
//#include<stdlib.h>
//using namespace std;
//
//typedef struct {
//    int age;
//    double height;
//}Person,*PPerson;
//
//void printPerson(Person p)
//{
//    cout << p.age << "," << p.height << endl;
//}
//
//int main()
//{
//    //动态创建一个person
//    PPerson pperson = (Person*)malloc(sizeof(Person));
//    pperson->age = 10;
//    pperson->height = 19.8;
//    printPerson(*pperson);
//    free(pperson);
//    int* pa =(int*)malloc(sizeof(int));
//    *pa = 10;
//    cout <<&pa << "," << *pa << endl;
//    free(pa);
//    return 0;
//}
//#include<iostream>
//using namespace std;
//
//void swapValue(int* a, int* b) {
//    int temp = *a;
//    *a = *b;
//    *b = temp;
//}
//
//int main()
//{
//    int a = 10, b = 80;
//    swapValue(&a, &b);
//    cout << a << "," << b << endl;
//    return 0;
//}

//++i返回的是i+1 i本身也加1
//i++返回的是i  i本身增加1



//#include<iostream>
//using namespace std;
//
////求n的阶乘
//int fac(int n)
//{
//    if (n == 0 || n == 1) {
//        cout << "汇聚fac(" << n << ")的阶乘结果" << endl;
//        return 1;
//    }
//    else {
//        cout << "将" << n << "分解为" << n << "*fac(" << n - 1 << ")" << endl;
//        int result = fac(n - 1);
//        cout << "汇聚" << n << "*fac" << n - 1
//            << ")" << endl;
//        return n * result;
//    }
//}//递归就是一个分配再整合的过程
//
//
//int main()
//{
//    printf("5!=%d\n", fac(5));
//    return 0;
//}
//
////递归的关键分解合并的模型以及结束的条件


//#include<iostream>
//using namespace std;
//
//int fact(int n)
//{
//    if (n == 0 || n == 1) {
//        return 1;
//    }
//    else {
//        return n * fact(n - 1);
//    }
//}
//int main()
//{
//    cout << fact(4) << endl;
//    return 0;
//}


//动态数组
#include<iostream>
using namespace std;

void testStaticArray() {
    //初始化数组
    int a[] = { 1,2,3,4,5 };
    int sizeA = sizeof(a) / sizeof(int);
    cout << "方式一访问静态数组：" << endl;
    for (int i = 0; i <sizeA; i++) {
        cout << a[i] << "\t";
    }
    cout << endl;
    //方式二访问数组a
    //数组名a:表示数组的首地址
    cout << "方式二访问静态数组" << endl;
    int* b = a;
    int count = 0;
    while (count < sizeA) {
        //访问当前b指向位置上的值
        cout << *b << "\t";
        b++;
        count++;
    }
    cout << endl;
}

void testDynamicArray() {
    //初始化数组a 1 2 3 4 5
    int sizeA = 5;
int* a = (int*)malloc(sizeA * sizeof(int));
    cout << "方式一访问动态数组：赋值操作" << endl;
    for (int i = 0; i < 5; ++i) {
        a[i] = i + 1;
    }

    //方式二访问数组A
    //数组名a表示这个数组的首地址
    cout << "方式二访问动态数组" << endl;
    int* b = a;
    int count = 0;
    while (count < sizeA)
    {
        //访问当前位置上的值
        cout << *b << "\t";
        //去数组的下一位
        b++;
        count++;
    }
    cout << endl;
    free(a);
}

int main()
{
    testStaticArray();
    testDynamicArray();
    return 0;
}