如何在C中将数组传递给函数

Question

I am taking a number in the main function, make it an array in make_array function. In the palindrome function, I need to check the array which i made in the make_array function but it is not visible in the palindrome function.

How can I solve this problem?

#include<stdio.h>
#define N 5

void make_array(int n);
int palindrome(int ar[],int size);

int main()
{
    int num;
    printf("Enter a number to check: ");scanf("%d",&num);

    make_array(num);

    if(palindrome(/*Don't know what should I write here*/))
         printf("It is palindrome");

    else
         printf("It is not palindrome");
}

void make_array(int n)
{
    int arr[N];
    int digit,i=0;

    while(n>0){
        digit=n%10;
        arr[i]=digit;
        n/=10;
        i++;
    }

    printf("Array: ");
    for(i=0; i<N; i++)
        printf("%d ",arr[i]);
}

int palindrome(int ar[],int size)
{
    int i,j;
    int temp[N];
    j=N;

    for(i=0; i<N; i++)
        temp[i]=ar[i];


    for(i=0; i<N; i++){
        if(temp[j-1]!=ar[i])
            return 0;
        j--;

    }


    return 1;

}

Answer 1

The best way is to leave allocation to the caller. Then you can simply do

int main()
{
    int num;
    printf("Enter a number to check: ");scanf("%d",&num);

    int array[num];

    fill_array(num, array);

where fill_array does what "make_array" does in your code, minus the allocation part.

void fill_array(int num, int array[num]);

The palindrome function could be rewritten similarly:

int palindrome(int size, int array[size])

All of this uses the concept of variable-length arrays (VLA).

Answer 2

I have done some modification in your code so please refer it.

#include<stdio.h>
#include "stdafx.h"

#define N 5

int make_array(int n, int *arr);
int palindrome(int ar[],int size);

int main()
{
    int num;
    int arr[N];
    int iRet;

    printf("Enter a number to check: ");scanf_s("%d",&num);

    iRet = make_array(num, arr);

    if(palindrome(arr, iRet))
         printf("It is palindrome");

    else
         printf("It is not palindrome");
}

int make_array(int n, int *arr)
{
    //int arr[N];
    int digit,i=0;

    while(n>0){
        digit=n%10;
        arr[i]=digit;
        n/=10;
        i++;
    }

    printf("Array: ");
    for(int j=0; j<i; j++)
        printf("%d ",arr[j]);

    return i;
}

int palindrome(int ar[],int size)
{
    int i,j;
    int temp[N];
    j=size;

    for(i=0; i<size; i++)
        temp[i]=ar[i];


    for(i=0; i<size; i++){
        if(temp[j-1]!=ar[i])
            return 0;
        j--;

    }


    return 1;

}

Answer 3

The problem is with your make array function. When a function is called, the stack grows down and registers and pointers are allocated to save the point from which that function was called, now, here you send n by value and your function creates a place on the stack for an array that you fill- BUT- when your function returns- the stack pointer returns back up to the caller( if your function has a return value it will be saved in a pre-allocated place, but other than that all of the other function data on stack is unavailable.).

So in general, if you want a function to create an array that could be used later on it must be allocated on heap you can either return int* or send foo(int**) to the function that will hold the add. of the new allocated array.

another option is to allocate that array[N] in your main, and send foo(int arr[], int n, size_t size) to the function. Since the array was allocated by the caller in main- this memory will be valid for all of the main function life.

so option 1)

int main()
{
 int num;
 int* array;
 printf("Enter a number to check: ");scanf("%d",&num);
 array = make_array(num, N);

 if(palindrome(array, N))
     printf("It is palindrome");

 else
     printf("It is not palindrome");

 free(array); /*free heap allocation */
}


int* make_array(int n, size_t size)
{
int* arr;
int digit ,i=0; 

arr = malloc(sizeof(int)*size);
if(NULL == arr)
{
   return NULL; /* malloc failed*/
}
while(n>0 && i<size){
    digit=n%10;
    arr[i]=digit;
    n/=10;
    i++;
}

printf("Array: ");
for(i=0; i<N; i++)
    printf("%d ",arr[i]);

 return arr;
 }

or 2)

int main()
{
int num;
int array[N];/*array saved on stack in main function */
printf("Enter a number to check: ");scanf("%d",&num);

make_array(array,num, N);

if(palindrome(/*Don't know what should I write here*/))
     printf("It is palindrome");

else
     printf("It is not palindrome");
}



void make_array(int* arr, int n, size_t size)
{

int digit,i=0;

if(NULL == arr)/*if arr is not a valid pointer*/
{
   return;
}
while(n>0 && i<size){
    digit=n%10;
    arr[i]=digit;
    n/=10;
    i++;
}

printf("Array: ");
for(i=0; i<N; i++)
    printf("%d ",arr[i]);
}