Untitled
unknown
plain_text
8 months ago
785 B
3
Indexable
#include <stdlib.h>
#include <stdio.h>
int ft_ultimate_range(int **range, int min, int max)
{
int r;
int c;
int len;
int *ptr;
int count;
int i;
int j;
r = 3;
c = 4;
len = 0;
len = sizeof(int *) * r + sizeof(int) * c * r;
range = (int **)malloc(len);
ptr = (int*)(range + r);
i = 0;
while(i < r)
{
range[i] = (ptr + c * i);
i++;
}
i = 0;
while (i < r)
{
j = 0;
while(j < c)
{
range[i][j] = ++count;
j++;
}
i++;
}
i = 0;
while(i < r)
{
j = 0;
while(j < c)
{
printf("i : %i, j : %i, range[i][j] : %i\n", i, j, range[i][j]);
j++;
}
i++;
}
return (r);
}
int main()
{
int **j;
int i;
i = ft_ultimate_range(j, 2, 9);
printf("i : %i", i);
i = 0;
while(j[i])
printf("i : %i , j[i] : %i\n", i, j[i]);
return 0;
}Editor is loading...
Leave a Comment