CodeSignal problem. I want to complete the code - arrays

I have the following problem. The function printMatrix
Receive an matrix for example:
matrix:
[[0,1,1,2],
[0,5,0,0],
[2,0,3,3]]
The code that I must use is the following:
// Definition for arrays:
// typedef struct arr_##name {
// int size;
// type *arr;
// } arr_##name;
//
// arr_##name alloc_arr_##name(int len) {
// arr_##name a = {len, len > 0 ? malloc(sizeof(type) * len) : NULL};
// return a;
// }
//
//
void printMatrix(arr_arr_integer matrix)
{
}
As a clue they give me that the number of columns and rows can be determined in the following way.
int columns = matrix.arr->size; //No.columns
int rows = matrix.size; //No.rows
//Or
int columns = matrix.arr[0].size; //No.columns
int rows = matrix.size; //No.rows
My question lies in how is the rest of the code written so that the previous tracks can work?
That is, for this to work within the function printMatrix
What should you add or modify in your code for the above methods to work?
typedef struct arr_arr_integer {
int size;
type *arr;
} arr_arr_integer;
arr_arr_integer alloc_arr_arr_integer(int len) {
arr_arr_integer a = {len, len > 0 ? malloc(sizeof(type) * len) : NULL};
return a;
}
void printMatrix(arr_arr_integer matrix)
{
int columns = matrix.arr->size; //No.columns
int rows = matrix.size; //No.rows
//print matrix?
}
int main(int argc, char const *argv[])
{
//input matrix?
printMatrix(arr_arr_integer matrix)
return 0;
}
I repeat. I must use this code strictly
int columns = matrix.arr->size; //No.columns
int rows = matrix.size; //No.rows
The problem is that when I try to use those tracks I get the following compilation error.
error: request for member 'size' in something not a structure or union

The function alloc_arr_integer allocates a 1D array of integers.
If you need a 2D array, you'll have to call the function multiple times.
Something like:
arr_integer my2Darray[rows];
// Create the 2D array
for (int i = 0; i < rows; ++i)
{
my2Darray[i] = alloc_arr_integer(columns);
assert(my2Darray[i].arr != NULL);
}
// Initialize the 2D array
for (int i = 0; i < rows; ++i)
{
for (int j = 0; j < columns; ++j)
{
my2Darray[i].arr[j] = i * 1000 + j;
}
}
Putting it together:
int main(void)
{
int rows = 3;
int columns = 5;
arr_integer my2Darray[rows];
// Create the 2D array
for (int i = 0; i < rows; ++i)
{
my2Darray[i] = alloc_arr_integer(columns);
assert(my2Darray[i].arr != NULL);
}
//Initialize the 2D array
for (int i = 0; i < rows; ++i)
{
for (int j = 0; j < columns; ++j)
{
my2Darray[i].arr[j] = (i + 1) * 1000 + j;
}
}
for (int i = 0; i < rows; ++i)
{
for (int j = 0; j < columns; ++j)
{
printf("%d ", my2Darray[i].arr[j]);
}
printf("\n");
}
return 0;
}
OUTPUT
1000 1001 1002 1003 1004
2000 2001 2002 2003 2004
3000 3001 3002 3003 3004

I assume memory allocation for 'matrix' is done somewhere else.
void printMatrix(arr_arr_integer matrix)
{
int rows = matrix.size;
int columns = matrix.arr.size;
int i, j = 0;
/*print array*/
for (i = 0; i < rows; i++)
{
for (j = 0; j < columns; j++)
printf("%d ", a.arr[i].arr[j]);
printf("\n");
}
}

I was practicing for code signal and I wrote my own functions to stablish the arrays. They are as shown below (even though this is a little bit too late maybe).
typedef struct arr_integer
{
int size;
int *arr;
} arr_integer;
typedef struct arr_arr_integer
{
int size;
arr_integer *arr;
} arr_arr_integer;
arr_integer alloc_arr_integer(int size)
{
arr_integer *pointer;
pointer = malloc(sizeof(arr_integer));
pointer->size = size;
pointer->arr = malloc(size * sizeof(int));
return *pointer;
}
arr_arr_integer alloc_arr_arr_integer(int size)
{
arr_arr_integer *pointer;
pointer = malloc(sizeof(arr_arr_integer));
pointer->size = size;
pointer->arr = malloc(size * sizeof(arr_integer));
for (int i = 0; i < size; i++)
{
pointer->arr[i].arr = malloc(size * sizeof(int));
}
return *pointer;
}

Related

passing a char 2d array into a void function in c

I'm new to c but I have been trying for ages to try and get this to work even though it seems so simple.
So below is what I am aiming to do which is working but I want to make 2 functions: fillseats() and printseatingplan()[for now I just want them all blank];
#include <stdio.h>
#include <string.h>
#include <ctype.h>
int main()
{
char seatingplan[15][15];
memset(seatingplan,'.',sizeof seatingplan);
for (int k = 0; k < 15; ++k)
{
for(int j = 0; j < 15; ++j)
{
printf("%c",seatingplan[k][j]);
}
printf("\n");
}
}
So whenever I try to run these functions without pointers it gives me these �`:�ij:�
i�d:�iH#=�i
�B��ik:�
how can i use pointers to fix this
can I pass this array into the functions where printseatingplan()
void printseatingplan(char array[15][15])
{
for (int k = 0; k < 15; ++k)
{
for(int j = 0; j < 15; ++j)
{
printf("%c",array[k][j]);
}
printf("\n");
}
}
and then fillseats() does:
void fillseats(char array[15][15])
{
memset(array,'.',sizeof array);
}
sizeof will give you only the size of the pointer, not the whole array.
You need to pass the sizes to the function. I would use pointer to array:
void fillseats(size_t rows, size_t cols, char (*array)[cols])
{
memset(array,'.',rows * sizeof(*array));
}
void printseatingplan(size_t rows, size_t cols, char (*array)[cols])
{
for (size_t row = 0; row < rows; row++)
{
for(size_t col = 0; col < cols; col++)
{
printf("%c",array[row][col]);
}
printf("\n");
}
}
char array[15][15] when used as parameter to a function "decays" into a pointer to the first element, in this case equivalent to char (*array)[15]). If you do sizeof array instead the function, you get the size of a pointer (4 or 8 etc). If you do sizeof *array you just get the size of one dimension, 15.
A simple way to fix it:
#include <stdio.h>
#include <string.h>
void fillseats (size_t x, size_t y, char array[x][y])
{
memset(array, '.', sizeof(char[x][y]));
}
void printseatingplan (size_t x, size_t y, char array[x][y])
{
for (size_t i = 0; i < x; i++)
{
for(size_t j = 0; j < y; j++)
{
printf("%c",array[i][j]);
}
printf("\n");
}
}
int main (void)
{
char seatingplan[15][15];
fillseats(15, 15, seatingplan);
printseatingplan(15, 15, seatingplan);
}
The size of array is bound to its type. The problem is that the parameters of array type decay to pointers. To prevent it, you can pass a pointer to an array. The pointer don't decay thus the essential part of the array type prevails.
void printseatingplan(char (*array)[15][15])
{
for (int k = 0; k < 15; ++k)
{
for(int j = 0; j < 15; ++j)
{
printf("%c", (*array)[k][j]);
}
printf("\n");
}
}
void fillseats(char (*array)[15][15])
{
memset(*array,'.',sizeof *array);
}
int main (void)
{
char seatingplan[15][15];
fillseats(&seatingplan);
printseatingplan(&seatingplan);
}

seg fault when I try to create a 2d array of structs

Why would I be getting a seg fault at the highlighted line. Am I accessing the 2d array wrong? tempMap is a 1d array with all the values for the 2d array, for example [0,1,0,0,0,0,1,0] and since I know the number of rows and columns I am trying to make it into a 2d array of Spaces (which is my struct). Any help is very much appreciated.
int opt;
char *filename = NULL;
Space **map;
char *tempMap;
if (i != 0){
int col = getCol(filename);
int row = getRow(filename, col);
printf("%d x %d\n", row, col);
map = create_map(row, col, filename);
tempMap = populate_map(map, filename);
int curIndx=0;
for (int l = 0; l < 100; ++l) {
printf("%c", tempMap[l]);
}
for (int j = 0; j < row; ++j) {
for (int k = 0; k < col; ++k) {
map[j][k] = makeNewSpace(tempMap[curIndx],row,col); //<-----------This Line
curIndx++;
}
}
}
Also here is the makeNewSpace()
Space makeNewSpace(char character, int row, int column){
Space space;
space.character = character;
space.isVisited = false;
space.row= row;
space.column = column;
return space;
}
And this is where I allocate space for the 2d array.
Space **create_map( int row, int col, char *fileName) {
Space *values = calloc(row * col, 2* sizeof(char) + (4 * sizeof(int)));
Space **map = malloc(row * sizeof(char *));
for (int i = 0; i < row; ++i) {
map[i] = values + i * col;
}
return map;
}
Lastly here is my struct
typedef struct Space{
char character;
bool isVisited;
int row;
int column;
}Space;
Not sure if this is what you're going for, a dynamically allocated 2d array of Space structs.
#include <stdio.h>
#include <stdlib.h>
// Space struct definition
typedef struct {
int data;
} Space;
int main() {
int i;
// Allocate memory for the rows
Space** space2d = malloc(sizeof(Space*) * 3);
// Allocate memory for the columns
for(i = 0; i < 3; ++i) {
space2d[i] = malloc(sizeof(Space) * 5);
}
// Example setting one of the struct's members inside the 2d array
space2d[0][0].data = 100;
printf("%d\n", space2d[0][0].data);
// Freeing the 2d array
for(i = 0; i < 3; ++i)
free(space2d[i]);
free(space2d);
}

Passing array of pointers as argument to function in C

I've written a piece of code but I'm not sure about how it works.
I want to create an array of pointers and pass it as argument to a function, like the following:
int main()
{
int *array[10] = {0};
for(int i = 0; i < 3; i++)
{
array[i] = (int *)malloc(3*sizeof(int *));
}
testFunction(array);
for(int i = 0; i < 3; i++)
{
free(array[i]);
}
return 0;
}
void testFunction(int *array[3])
{
//do something
return;
}
What I don't understand is the following. I declare array as an array of pointers, allocate memory to it by using malloc and then proceed to call testFunction. I want to pass the array by reference, and I understand that when I call the function by using testFunction(array), the array decays to a pointer to its first element (which will be a pointer also). But why in the parameters list I have to write (int *array[3]) with * and not just (int array[3])?
A parameter of type * can accept an argument of type [], but not anything in type.
If you write void testFunction(int arg[3]) it's fine, but you won't be able to access array[1] and array[2] and so on, only the first 3 elements of where array[0] points to. Also a comversion is required (call with testFunction((int*)array);.
As a good practice, it's necessary to make the function parametera consistent with what's passed as arguments. So int *array[10] can be passed to f(int **arg) or f(int *arg[]), but neither f(int *arg) nor f(int arg[]).
void testFunction(int **array, int int_arr_size, int size_of_array_of_pointers)
{
for(int j = 0; j < size_of_array_of_pointers; j++)
{
int *arrptr = array[j]; // this pointer only to understand the idea.
for(int i = 0; i < int_arr_size; i++)
{
arrptr[i] = i + 1;
}
}
}
and
int main()
{
int *array[10];
for(int i = 0; i < sizeof(array) / sizeof(int *); i++)
{
array[i] = malloc(3*sizeof(int));
}
testFunction(array, 3, sizeof(array) / sizeof(int *));
for(int i = 0; i < sizeof(array) / sizeof(int *); i++)
{
free(array[i]);
}
return 0;
}
Evering depends on what // do something means in your case.
Let's start from simple : perhaps, you need just array of integers
If your function change only values in array but does not change size, you can pass it as int *array or int array[3].
int *array[3] allows to work only with arrays of size 3, but if you can works with any arrays of int option int *array require additional argument int size:
void testFunction(int *array, int arr_size)
{
int i;
for(i = 0; i < arr_size; i++)
{
array[i] = i + 1;
}
return;
}
Next : if array of pointers are needed
Argument should be int *array[3] or better int **array (pointer to pointer).
Looking at the initialization loop (I changed sizeof(int *) to sizeof(int))
for(int i = 0; i < 3; i++)
{
array[i] = (int *)malloc(3*sizeof(int));
}
I suppose you need 2-dimension array, so you can pass int **array but with sizes of two dimensions or one size for case of square matrix (height equal to width):
void testFunction(int **array, int wSize, int hSize)
{
int row, col;
for(row = 0; row < hSize; row++)
{
for(col = 0; col < wSize; col++)
{
array[row][col] = row * col;
}
}
}
And finally : memory allocation for 2D-array
Consider the following variant of your main:
int main()
{
int **array;
// allocate memory for 3 pointers int*
array = (int *)malloc(3*sizeof(int *));
if(array == NULL)
return 1; // stop the program
// then init these 3 pointers with addreses for 3 int
for(int i = 0; i < 3; i++)
{
array[i] = (int *)malloc(3*sizeof(int));
if(array[i] == NULL) return 1;
}
testFunction(array, 3, 3);
// First, free memory allocated for int
for(int i = 0; i < 3; i++)
{
free(array[i]);
}
// then free memory allocated for pointers
free(array);
return 0;
}
Pay attention, that value returned by malloc should be checked before usage (NULL means memory was not allocated).
For the same reasons check can be added inside function:
void testFunction(int **array, int wSize, int hSize)
{
int row, col;
if(array == NULL) // check here
return;
for(row = 0; row < hSize; row++)
{
if(array[row] == NULL) // and here
return;
for(col = 0; col < wSize; col++)
{
array[row][col] = row * col;
}
}
}

Why is my sorting method in qsort changing my array?

https://phoxis.org/2012/07/12/get-sorted-index-orderting-of-an-array/
I tried the method here under the section
Using qsort in C
to sort an array and return the indices, changing the array base_arr to be of type double*. However, when I print the arr[idx[i]] to the screen, half of the values have been changed to 0 and have been sorted as if they had always been 0. What could cause this to happen?
double *BASE_ARR;
int main(int argc, char *argv[]) {
int N = par->N;
int K = par->K;
double *ptr;
ptr = (double *) malloc(N*sizeof(ptr));
int *idx;
idx = (int *) malloc(N*sizeof(idx));
// generate the array to be sorted (ptr), in a separate file
for (int i = 0; i < N; i++) {
idx[i] = i;
}
BASE_ARR = ptr;
// sort
qsort(idx, N, sizeof(idx), idxSort);
for (int i = 0; i < N; i++) {
printf("%f\n",ptr[idx[i]]);
}
for (int i = 0; i < N; i++) {
printf("%d\n",idx[i]);
}
for (int i = 0; i < K; i++) {
idx[i] = -1;
}
return 0;
}
static int idxSort (const void *a, const void *b) {
int aa = *((int *)a), bb = *((int *)b);
if (BASE_ARR[aa] < BASE_ARR[bb]) {
return -1;
}
if (BASE_ARR[aa] == BASE_ARR[bb]) {
printf("what");tack
return 0;
}
if (BASE_ARR[aa] > BASE_ARR[bb]) {
return 1;
}
}
qsort(idx, N, sizeof(idx), idxSort);
should be
qsort(idx, N, sizeof(*idx), idxSort);
idx is a pointer. qsort doesn't need to know the size of a pointer; it needs to know the size of the array element.
Same about your malloc calls. You need to use sizeof(*idx) and sizeof(*ptr) in them. By the way, do not cast the result of malloc.

Segmentation fault when freeing my matrix

I'm using code::blocks.
Code sends a seg fault when freeing the matrix after 2-3 iterations in dealloc_mat.
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
int **_mat;
int _lines, _columns;
void alloc_mat();
void dealloc_mat();
int main(int argc, char *argv[])
{
_lines = 31, _columns = 22;
alloc_mat();
dealloc_mat();
return 0;
}
void alloc_mat()
{
int i, row, col;
_mat = malloc(sizeof(int *) * _lines);
for(i = 0 ; i < _lines ; i++)
{
int *tmpMatrix = malloc(sizeof(int) * _columns);
_mat[i] = &tmpMatrix[i];
}
for(row = 0 ; row < _lines ; row++)
{
for(col = 0 ; col < _columns ; col++)
{
_mat[row][col] = 0;
}
}
}
void dealloc_mat()
{
int row;
for(row = 0; row < _lines; row++)
{
free(_mat[row]);
}
free(_mat);
}
Here's the bug:
_mat[i] = &tmpMatrix[i];
Should be
_mat[i] = &tmpMatrix[0];
or better
_mat[i] = tmpMatrix;
The problem is that you're not allocating it correctly. This:
for(i = 0 ; i < _lines ; i++)
{
int *tmpMatrix = malloc(sizeof(int) * _columns);
_mat[i] = &tmpMatrix[i];
}
should be this:
for(i = 0 ; i < _lines ; i++)
{
_mat[i] = malloc(sizeof(int) * _columns);
}
Further, _mat, _lines and _columns are reserved identifiers in C, and you shouldn't use them. Any identifier beginning with an underscore with file scope in the ordinary (i.e. _mat) or tag (i.e. struct _mat) namespaces is reserved.
Here are a couple of functions used to allocate memory for strings, arrays of strings actually, you can easily modify them for your purposes:
char **strings; // created with global scope (before main())
void allocMemory(int numStrings, int max)
{
int i;
strings = malloc(sizeof(char*)*(numStrings+1));
for(i=0;i<numStrings; i++)
strings[i] = malloc(sizeof(char)*max + 1);
}
void freeMemory(int numStrings)
{
int i;
for(i=0;i<numStrings; i++)
if(strings[i]) free(strings[i]);
free(strings);
}
Here is how the above would be modified (and used) for ints: (note, it is really just recognizing the differences in sizeof(type))
Note also: using malloc() does not initialize values. If you want to guarantee an initial value for each element (eg. 0), you can use calloc() instead.
void allocMemoryInt(int rows, int cols);
void freeMemoryInt(int numStrings);
int **array;
int main(void)
{
allocMemoryInt(10, 3);
freeMemoryInt(10);
return 0;
}
void allocMemoryInt(int rows, int cols)
{
int i;
array = malloc(sizeof(int *)*(rows)); //create memory for row pointers
for(i=0;i<rows; i++)
array[i] = malloc(sizeof(int)*cols + 1); //create memory for (row * col) elements
}
void freeMemoryInt(int rows)
{
int i;
for(i=0;i<rows; i++)
if(array[i]) free(array[i]);//call free for each row
free(array); //free pointer array(will clean up everything allocated)
}

Resources