【leetcode】和为s的连续正数序列

int** findContinuousSequence(int target, int* returnSize, int** returnColumnSizes){
    
    int** arr = (int**)malloc(sizeof(int)*target);
    int* col = (int*)malloc(sizeof(int) * target);
    int i=0,j=0;
    int row = 0;
    for (i=1; i<(float)target/2; i++)
    {
        int sum =0;
        for (j=i; j<target; j++)
        {
            sum += j;
            if (sum == target)
            {
                int* p = (int*)malloc(sizeof(int)*(j-i+1));
                for (int k=i; k<=j; k++)
                {
                    p[k-i] = k;
                }
                arr[row] = p;
                col[row++] = j-i+1;
                break;
            }
            else if(sum > target)
            {
                break;
            }
        }                        
    }
    *returnSize = row;
    *returnColumnSizes = col;
    return arr;    
}