Linux下的c程式—數組、malloc

來源:互聯網
上載者:User

#include <stdio.h>
#include <stdlib.h>

struct flex
{
    int count;
    double average;
    double scores[];   // 定義可伸縮的數組
}; // 聲明結構體

void showFlex(const struct flex * p);   //定義函數

int main(void)
{
    struct flex * pf1, *pf2;  

    int n = 5;  // 變數的初始化
    int i;
    int tot = 0;
    // allocate space for structure plus array
    pf1 = malloc(sizeof(struct flex) + n * sizeof(double)); //根據數組的大小申請地址空間
    pf1->count = n;
    for (i = 0; i < n; i++)
    {
        pf1->scores[i] = 20.0 - i;  //給數組元素賦值
        tot += pf1->scores[i]; 
    }
    pf1->average = tot / n;
    showFlex(pf1);

    n = 9;   
    tot = 0;
    pf2 = malloc(sizeof(struct flex) + n * sizeof(double));
    pf2->count = n;
    for (i = 0; i < n; i++)
    {
        pf2->scores[i] = 20.0 - i/2.0;
        tot += pf2->scores[i];
    }
    pf2->average = tot / n;
    showFlex(pf2); 
    free(pf1); //釋放地址空間
    free(pf2);
    return 0;
}

void showFlex(const struct flex * p)   //遍曆結構體中的數組並列印平均值
{
    int i;
    printf("Scores : ");
    for (i = 0; i < p->count; i++)
        printf("%g ", p->scores[i]);
    printf("\nAverage: %g\n", p->average);
}

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.