Leetcode skimming questions_ Sum of two numbers II - enter an ordered array

Title Description

 java resolvent

class Solution {
    public int[] twoSum(int[] numbers, int target) {
        int index1 = 0;
        int index2 = numbers.length - 1;
        int[] index = new int[2];
        while(index1 < index2)
        {
            if(numbers[index2] + numbers[index1] > target)
            {
                index2--;
            }
            else if(numbers[index2] + numbers[index1] < target)
            {
                index1++;
            }
            else
            {
                index[0] = index1 + 1;
                index[1] = index2 + 1;
                break;
            }
        }
        return index;
    }
}

 C resolvent

/**
 * Note: The returned array must be malloced, assume caller calls free().
 */
int* twoSum(int* numbers, int numbersSize, int target, int* returnSize){
    int *index = NULL;
    int index1 = 0;
    int index2 = numbersSize - 1;
    index = (int*)malloc(2 * sizeof(int));
    while(index1 < index2)
    {
        if(numbers[index1] + numbers[index2] > target)
        {
            index2--;
        }
        else if(numbers[index1] + numbers[index2] < target)
        {
            index1++;
        }
        else
        {
            index[0] = index1 + 1;
            index[1] = index2 + 1;
            break;
        }
    }
    *returnSize = 2;
    return index;
}

The variables returned must be dynamically opened up memory , Because local variables are stored on the stack , As the life cycle of the function ends, the memory will be destroyed , The dynamically opened memory is on the heap , End of the function , This memory will not be released .