一、题目描述
题目原文:
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.
(输入一个整型列表,以及一个目标值,返回该列表中加和为目标值的两个数的下标)
举例:
Given nums = [2, 7, 11, 15], target = 9, Because nums[0] + nums[1] = 2 + 7 = 9, return [0, 1].
注意:The return format had been changed to zero-based indices.
(即:下标要从0开始)
二、题目分析
这道题目用例较少,做的时候并不考虑列表内存在多种可能的情况,只要找出第一对即可,我采用的方法是循环内
嵌套循环,两遍循环解决问题:外循环变量i : 0 ~ 列表长度 - 1,内循环 j : i ~ 列表长度 - 1。
三、python代码
class Solution(object): def twoSum(self, nums, target): """ :type nums: List[int] :type target: int :rtype: List[int] """ for i in range(len(nums)): for j in range(i+1, len(nums)): if nums[i] + nums[j] == target: return [i, j]
四、其他
题目链接:https://leetcode.com/problems/two-sum/
Runtime: 5472 ms
想法不够优化,欢迎大家留言交流~