Leetcode刷题日记-1. 两数之和

找到整数，但是要求返回其下标，所以可以使用map的键对值，一个放数一个放下标

import java.util.Map
import java.util.HashMap

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

class Solution(object):
    def twoSum(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: List[int]
        """
        a = {}
        for i in range(0,len(nums)):
            if a.has_key(nums[i]):
                return(a[nums[i]],i)
            else:
                a[target-nums[i]]=i