[Python]Leetcode Two Sum类题目集合

1. 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].
代码实现

class Solution(object):
    def twoSum(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: List[int]
        """
        dict={}
        for ind,item in enumerate(nums):
            if target-item in dict:
                return [dict[target-item],ind]
            dict[item]=ind

167. Two Sum II - Input array is sorted

题目描述
Given an array of integers that is already sorted in ascending order, find two numbers such that they add up to a specific target number.

The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2.

Note:

Your returned answers (both index1 and index2) are not zero-based.
You may assume that each input would have exactly one solution and you may not use the same element twice.
Example:

Input: numbers = [2,7,11,15], target = 9
Output: [1,2]
Explanation: The sum of 2 and 7 is 9. Therefore index1 = 1, index2 = 2.
代码实现

class Solution(object):
    def twoSum(self, numbers, target):
        """
        :type numbers: List[int]
        :type target: int
        :rtype: List[int]
        """
        i,j = 1, len(numbers)
        while i<j:
            if numbers[i-1]+numbers[j-1]==target:
                return [i,j]
            elif numbers[i-1]+numbers[j-1]<target:
                i+=1
            else:
                j-=1
        return []

170. Two Sum III - Data structure design(暂被锁)

653. Two Sum IV - Input is a BST

题目描述
Given a Binary Search Tree and a target number, return true if there exist two elements in the BST such that their sum is equal to the given target.
代码实现

class Solution(object):
    def __init__(self):
        self.dict = collections.defaultdict(bool)
    def findTarget(self, root, k):
        """
        :type root: TreeNode
        :type k: int
        :rtype: bool
        """
        if root is None:
            return False
        if k-root.val in self.dict:
            return True
        self.dict[root.val] = True
        return self.findTarget(root.left, k) or self.findTarget(root.right, k)