【LeetCode】 1.两数之和

题目描述:（简单难度）

解题思路

有什么方法可以返回元素下标？

Java代码

class Solution {
    public int[] twoSum(int[] nums, int target) {
        Map<Integer,Integer> map = new HashMap<>();
        for(int i =0;i<nums.length;i++){
            if (map.containsKey(target-nums[i])){
                return new int[] {map.get(target-nums[i]),i};
            }
            map.put(nums[i],i);
        }
        return new int[] {-1,-1};
    }
}

Python代码

class Solution(object):
    def twoSum(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: List[int]
        """
        dict = {}
        for k, v in enumerate(nums):
            if target - v in dict:
                return [dict[target-v],k]
            else:
                dict[v] = k
                
s = Solution()
result = s.twoSum([2,7,11,15],9)
print(result)