Leetcode989.---数组形式的整形加法cx

/**
 * Note: The returned array must be malloced, assume caller calls free().
 */
int* addToArrayForm(int* A,int ASize, int K, int* returnSize){
    int kSize = 0;
    int num = K;
    while(num)
    {
        ++kSize;
        num /= 10;
    }
    int len = kSize > ASize ? kSize+1 : ASize + 1;
    int* retArr = (int*)malloc(sizeof(int)*len);
    int Ai = ASize - 1;
    int Ki = 0;
    int next = 0;//进位
    int reti = 0;
    while(Ai >= 0 || Ki < kSize)
    {
        int aVal = 0;
        if(Ai >= 0)
        {
            aVal = A[Ai--];
        }
        int kVal = K % 10;
        K /= 10;
        Ki++;
        int ret = aVal + kVal + next;
        if(ret >= 10)
        {
            next = 1;
            ret -= 10;
        }
        else
        {
            next = 0;
        }
        retArr[reti++] = ret;
    }
    if(next == 1)
    {
        retArr[reti++] = 1;
    }
    //逆置
    int begin = 0,end = reti -1;
    while(begin < end)
    {
        int tmp = retArr[begin];
        retArr[begin] = retArr[end];
        retArr[end] = tmp;
        begin++;
        --end;
    }
    *returnSize = reti;
    return retArr;
}