1.two sum

本文主要是介绍1.two sum，对大家解决编程问题具有一定的参考价值，需要的程序猿们随着小编来一起学习吧！

Question:

Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.

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

You can return the answer in any order.

Example 1:

Input: nums = [2,7,11,15], target = 9
Output: [0,1]
Output: Because nums[0] + nums[1] == 9, we return [0, 1].

Example 2:

Input: nums = [3,2,4], target = 6
Output: [1,2]

Example 3:

Input: nums = [3,3], target = 6
Output: [0,1]

Constraints:

• 2 <= nums.length <= 104
• -109 <= nums[i] <= 109
• -109 <= target <= 109
• Only one valid answer exists.

Answer:

class Solution(object):
    def twoSum(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: List[int]
        """
        for i in range (len(nums)-1):
            j = i + 1
            while j < len(nums):
                if nums[i] + nums[j] == target:
                    return [i,j]
                j += 1
                
a=Solution()
print(a.twoSum([2,7,11,15],9))
print(a.twoSum([3,2,4],6))
print(a.twoSum([3,3],6))

class Solution(object):    def twoSum(self, nums, target):        """        :type nums: List[int]        :type target: int        :rtype: List[int]        """        for i in range (len(nums)-1):            j = i + 1            while j < len(nums):                if nums[i] + nums[j] == target:                    return [i,j]                j += 1                a=Solution()print(a.twoSum([2,7,11,15],9))print(a.twoSum([3,2,4],6))print(a.twoSum([3,3],6))

这篇关于1.two sum的文章就介绍到这儿，希望我们推荐的文章对大家有所帮助，也希望大家多多支持为之网！