C++学习路程 22/3/5 AM 8:40

#include <iostream>
using namespace std;


int main()
{
    //数组找最大值
    int arr[] = { 300,350,200,400,250 };
    int max = 0;
    for (int i = 0; i < (sizeof(arr) / sizeof(arr[0]))-1; i++)
    {
        if ( arr[i] >= max)
        {          
            max = arr[i];
        }
    }
    cout << "max=" << max << endl;

    //元素逆置
    //Myself
     int arr[] = {1,2,3,4,5};
    int L = (sizeof(arr) / sizeof(arr[0]));
    int arr1[5] = {0};
    cout << "逆置之前是" << endl;
    for (int i = 0; i <= L - 1; i++)
    {
        cout <<  arr[i] << endl;
    }
    cout << "逆置之后是" << endl;
    for (int i = 0; i <= L - 1; i++)
    {
        arr1[i] = arr[L - i - 1];
        cout << arr1[i] << endl;
    } 
    //Course
    int arr[5] = {1,2,3,4,5};
    cout << "逆置之前是" << endl;
    for (int i = 0; i <5; i++)
    {
        cout << arr[i] << endl;
    }
    int start = 0;
    int end = (sizeof(arr) / sizeof(arr[0])) - 1;
    while (start < end)
    {
        int temp = arr[start];
        arr[start] = arr[end];
        arr[end] = temp;

        start++;
        end--;
    }
    cout << "逆置之后是" << endl;
    for (int i = 0; i < 5; i++)
    {
        cout << arr[i] << endl;
    }


    //冒泡排序
    int arr[] = {1,5,9,7,6,3,4,8,2};  
    for (int L = 0; L < (sizeof(arr) / sizeof(arr[0])) - 1; L++)//总需排序轮数
    {
        for (int i = 0; i < (sizeof(arr) / sizeof(arr[0]))-L-1; i++)//一次排序的次数
        {
            int temp = arr[i];
            if (arr[i] >= arr[i + 1])
            {
                arr[i] = arr[i + 1];
                arr[i + 1] = temp;
            }
        }
    }
    cout << "冒泡之后是" << endl;
    for (int a = 0; a < (sizeof(arr) / sizeof(arr[0])); a++)
    {
        cout << arr[a] << endl;
    }  

    
    //二维数组
    //二维数组从 第0行,第0列开始排序
    //1. 数据类型 数组名[行] [列]
    int arr[2][3];
    arr[0][0] =1;
    .....
    //2. 数据类型 数组名[行] [列]={{数据},{数据}}
    int arr[2][3] = {
        {1,2,3},
        {4,5,6}
    };
    //3. 数据类型 数组名[行] [列]={数据,数据。。。}
    int arr[2][3] = { 1,2,3,4,5,6 };
    //4. 数据类型 数组名[] [列]={数据,数据。。。}
    int arr[][3] = { 1,2,3,4,5,6 };/必须要有列数


    //二维数组案例
    //成绩求和
    int arr[3][3] = {
        {100,100,100},
        {90, 90, 90},
        {80,80,80}
    };
    string name[3] = {"A","B","C"};
        for (int h = 0; h <= sizeof(arr) / sizeof(arr[0])-1; h++)
        {
            int sum = 0;
            for (int L = 0; L <= sizeof(arr[0]) / sizeof(arr[0][0])-1; L++)
            {               
                sum = sum + arr[h][L];
            }
            cout << name[h] << "的分数为" << sum << endl;
        }



    


    system("pause");
    return 0;


    
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值