malloc calloc realloc

來源:互聯網
上載者:User




























 #include <stdio.h>
#include <stdlib.h>int main()
{
 int i;
 int nu = 0;
 int temp = 0;
 int *p = NULL;
 int *q = NULL; while(1)
 {
  if(scanf("%d", &temp) != 1)
  {
   return -1;
  }
  if(temp == -1)
  {
   break;
  }
  nu++;  q = p;  p = (int *)malloc(sizeof(int)*nu);
  if(NULL == p)
  {
   return -2;
  }
  
  for(i = 0; i < nu - 1; i++)
  {
   p[i] = q[i];
  }
  p[i] = temp;  if(q != NULL)
   free(q);
 } for(i = 0; i < nu; i++)
 {
  printf("%d ", p[i]);
 }
 printf("\n");
 free(p);
 p = q = NULL;
 
 return 0;
}
// the realloc dynamic one dimensional array#include <stdio.h>
#include <stdlib.h>int main()
{
 int i;
 int nu = 0;
 int temp = 0;
 int *p = NULL; while(1)
 {
  if(scanf("%d", &temp) != 1)
  {
   return -1;
  }
  if(temp == -1)
  {
   break;
  }
  nu++;  p = (int *)realloc(p,sizeof(int)*nu);
  if(NULL == p)
  {
   return -2;
  }
  
  p[nu - 1] = temp;
 } for(i = 0; i < nu; i++)
 {
  printf("%d ", p[i]);
 }
 printf("\n");
 free(p);
 p = NULL;
 
 return 0;
}

相關文章

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在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.