求解leetcode分式化简

#include <stdio.h>

//leetcode 分式化简

int arr[2];
int* fraction(int* cont, int contSize, int* returnSize);

int main()
{
//    int arrData[1] = {2147483647};
    int arrData[4] = {3,2,0,2};
    int size;
    fraction(arrData,sizeof(arrData)/sizeof(int),&size);
}
int* fraction(int* cont, int contSize, int* returnSize)
{
    int i = contSize-1;
    int denominator = 0;
    int molecule = 0;
    for(;i>=0;i--)
    {
        //如果是第一个
       if(i==contSize-1){
            arr[1] = 1;
            arr[0] = *(cont+i);//分子;
        }else{
            //要进行分子分母的计算
            denominator = arr[0];
            //分子
            molecule = arr[1]+(*(cont+i)*arr[0]);

            arr[1] = denominator;
            arr[0] = molecule;
        }
    }
    *returnSize = 2;
    return arr;
}