LeetCode OJ 系列之1 Two Sum --Python
来源:互联网 发布:qq mac版手机 编辑:程序博客网 时间:2024/06/06 00:49
Problem:
Given an array of integers, 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. Please note that your returned answers (both index1 and index2) are not zero-based.
You may assume that each input would have exactly one solution.
Input: numbers={2, 7, 11, 15}, target=9
Output: index1=1, index2=2
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)): if target-nums[i] in nums: index_nums = nums.index(target-nums[i]) tmp_nums = [j for j,v in enumerate(nums) if v==(target-nums[i]) and j!=i] if len(tmp_nums) > 0: index_nums = tmp_nums[-1] return sorted([1+i,1+index_nums]) return None
0 0
- LeetCode OJ 系列之1 Two Sum --Python
- leetcode【1+167 Two Sum 系列】【python】
- LeetCode OJ 1Two Sum
- LeetCode OJ : 1 Two Sum
- LeetCode系列之Two sum
- LeetCode OJ:Two Sum
- LeetCode OJ : two sum
- LeetCode OJ -Two Sum
- LeetCode OJ Two Sum
- [LeetCode OJ] Two Sum
- Two Sum LeetCode OJ
- LeetCode OJ - Two Sum
- LeetCode OJ ----Two Sum
- LeetCode OJ--Two Sum
- Two Sum (LeetCode OJ)
- LeetCode OJ:Two sum
- Python leetcode #1 Two Sum
- LeetCode OJ 1 Two Sum [Easy]
- leetcode Path Sum II
- Spring Boot自动配置源码
- macpro 装Ubuntu15 虚拟机 字太小的调节方法
- 检测文件中是否存在bom
- XSS攻击测试语句
- LeetCode OJ 系列之1 Two Sum --Python
- Android Studio Tips-倍数提高工作效率的Android Studio奇技
- Oracle视图
- 基于JQUERY的WEB在线流程图设计器GOOFLOW 0.5版
- Android 键盘使用一(监听弹出隐藏)
- LeetCode OJ 系列之62 Unique Paths --Python
- 一些系统漏洞
- 打包输出文件太大
- 数据结构 — 树 与 二叉树、森林