zoukankan      html  css  js  c++  java
  • 柔性数组--变长数组

    int init_Department(manager *pt)
    {
      assert( NULL != pt && pt->p != NULL) ;

      pt->p->Manager = 10;
      pt->p->PM =100;
      pt->p->ProgrammerNo[0]=10000;
      pt->p->ProgrammerNo[1]=10001;
      pt->p->ProgrammerNo[2]=10002;
      pt->p->ProgrammerNo[3]=10003;
      pt->p->ProgrammerNo[4]=10004;

      return 0;
    }

    typedef struct _Department  

    {  
        int Manager;  
        int PM;  
        int ProgrammerNo[0];  
    }Department;  
    
     typedef struct _manager{
        Department *p;
    }manager;
      
    int main(void)  
    {  
        printf("sizeof(Department)=%d
    ",sizeof(Department));
        Department *pt = NULL;  
        int Num = 5;  
        pt = (Department *)malloc(sizeof(Department) + sizeof(int) * Num);  
      
        pt->ProgrammerNo[0] = 006;  
        pt->ProgrammerNo[1] = 99; 
    
        manager *ptr = ( manager *)malloc(sizeof(manager));
        ptr->p=(Department*)malloc(sizeof(Department)+sizeof(int)*5);
        init_manager (ptr);
    }
  • 相关阅读:
    NYOJ-301递推求值
    二叉树
    从c到c++
    NYOJ-93汉诺塔(三)
    历届试题 最大子阵
    最大子序列和最大子矩阵
    【贪心】电视节目安排
    【贪心】线段覆盖
    【贪心】取数游戏
    【贪心】智力大冲浪
  • 原文地址:https://www.cnblogs.com/chengliangsheng/p/4086098.html
Copyright © 2011-2022 走看看