LeetCode 热题 1/100打卡

C++:

int *twoSum(int* nums, int numsSize, int target, int* returnSize) {
    int *result = (int*)malloc(2*sizeof(int));
    for(int i=0;i<numsSize;i++){
        for(int j=i+1;j<numsSize;j++){
            if((nums[i]+nums[j])==target){
                result[0]=i;
                result[1]=j;
                *returnSize = 2;
            }
        }
    }
    return result;
}

Python:

class Solution:
    def twoSum(self, nums: List[int], target: int) -> List[int]:
        left =0
        right = len(nums)-1
        for i in range(0, len(nums)):
            for j in range(i+1,len(nums)):
                if nums[i]+nums[j]==target:
                    return [i,j]