Sum of two leetcode numbers

LeetCode Sum of two numbers

LeetCode Day 4
subject ： Given an array of integers nums And an integer target value target, Please find and as the target value in this array target the Two Integers , And return their array subscripts .

Suppose that each input corresponds to only one answer . however , The same element in the array cannot be repeated in the answer . Answers can be returned in any order .

Example 1：
Input ：nums = [2,7,11,15], target = 9
Output ：[0,1]
explain ： because nums[0] + nums[1] == 9 , return [0, 1] .

Topic link ：https://leetcode-cn.com/problems/two-sum/

Violent problem solving

/** * Note: The returned array must be malloced, assume caller calls free(). */
int* twoSum(int* nums, int numsSize, int target, int* returnSize)
{
    
    int i,j;
    for(i=0;i<numsSize;i++)
    {
    
        for(j=i+1;j<numsSize;j++)
        {
    
            if(nums[i]+nums[j]==target)
            {
    
                int *result=(int*)malloc(sizeof(int)*2);
                result[0]=i;
                result[1]=j;
                *returnSize=2;   
                return result;
            }
        }     
    }
    return 0;
}