1. 两数之和(twoSum)

最新推荐文章于 2023-02-01 14:16:01 发布

赵敏丫头

最新推荐文章于 2023-02-01 14:16:01 发布

阅读量100

点赞数

分类专栏： Algorithm_leetCode

本文链接：https://blog.csdn.net/weixin_44294385/article/details/112337405

版权

Algorithm_leetCode 专栏收录该内容

7 篇文章 0 订阅

订阅专栏

1. 两数之和(twoSum)

1. python

class Solution:
    def twoSum(self, nums: List[int], target: int) -> List[int]:
        # nums_length = len(nums)
        # for i in range(nums_length):
        #     for j in range(i+1,nums_length):
        #         if target ==nums[i]+nums[j]:
        #             return [i,j]
        hashMap = dict()
        for i,num in enumerate(nums):
            if target-num in hashMap:
                return [hashMap[target-num],i]
            hashMap[num]=i

2. Java

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