Two Sum [leetcode 1]

链接：https://leetcode.com/problems/two-sum/

LeetCode
OJ

LeetCode Premium
Subscription
Problems 
Pick
One
Mock
Courses
Discuss
Book
honeyaya 

1. Two Sum

My Submissions

Question

Total Accepted: 192702 Total
Submissions: 898652 Difficulty: Medium

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.
Example:

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

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

UPDATE (2016/2/13):

The return format had been changed to zero-based indices. Please read the above updated description carefully.

Subscribe to see which companies asked this question

Show Tags

Show Similar Problems

主要是为了练习python

class Solution(object):
def twoSum(self, nums, target):
"""
:type nums: List[int]
:type target: int
:rtype: List[int]
"""

for i,num1 in enumerate(nums):
for j,num2 in enumerate(nums):
if j > i :
if num1 + num2 == target:
return i,j

                

Send
Feedback