Leecode题目1打卡

Leecode题目1打卡

class Solution:
    def twoSum(self,nums,target):
        length = len(nums)
        dir1={}
        for i in range(length):
            dir1[nums[i]]=i
            if (target-nums[i]) in dir1:
                if dir1[target-nums[i]] != i :
                    return [dir1[target-nums[i]],i]
nums = [3,3]
target = 6
x = Solution()
a=x.twoSum(nums,target)
print(a)

运行失败，更改为：

class Solution:
    def twoSum(self,nums,target):
        length = len(nums)
        dir1={}
        for i, num in enumerate(nums):
            if (target - num) in dir1:
                return dir1[target-num],i
            else:
                dir1[nums[i]]=i
nums = [2,5,6,7]
target = 9
x = Solution()
a=x.twoSum(nums,target)
print(a)

Tips

enumerate用法
python数据遍历可从后往前，和传统思维逻辑较为不同