python LeetCode-Algorithms 给定一个整数数组和一个目标值，找出数组中和为目标值的两个数

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