two_sum

Given an array of integers, return indices of the two numbers such that they add up to a specific target.

You may assume that each input would have exactly one solution, and you may not use the same element twice.

Example:

Given nums = [2, 7, 11, 15], target = 9,

Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].

My code:
class Solution:
    def twoSum(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: List[int]
        """
        search_dict={}
        for i in range(len(nums)):
            search_dict[int(nums[i])]=i
        for i in range(len(nums)-1):
            value=int(target-nums[i])
            if value in search_dict.keys():
                j=search_dict[value]
                if j==i:
                    continue
                return [i,j]
        return None
        
Solution:
https://leetcode.com/problems/two-sum/solution/