LeetCode(1) Two Sum
来源:互联网 发布:淘宝官网电脑版 编辑:程序博客网 时间:2024/06/05 05:12
问题定义:给定一个数组nums和一个正整数target,在数组中找出两个数(一定存在)使两个数之和等于target。
思路:用Hash表建立方向索引
时间复杂度:O(n)
注意点:id2!=id
class Solution: def twoSum(self, nums, target): dict={} for id,num in enumerate(nums): dict[target-num]=id for id,num in enumerate(nums): id2=dict.get(num) if id2 is not None and id2!=id: return [id,dict[num]]
阅读全文
0 0
- LeetCode 1 - Two Sum
- leetcode 1 Two Sum
- Leetcode【1】:Two Sum
- [leetcode 1] Two Sum
- 【leetcode-1】Two Sum
- [leetcode 1] Two Sum
- [Leetcode] 1 - Two Sum
- LeetCode (1) Two Sum
- LeetCode 1:《Two Sum》
- LeetCode | #1 Two Sum
- leetcode-1 Two Sum
- Two Sum | LeetCode(1)
- [Leetcode]1Two Sum
- leetcode 1 Two Sum
- leetcode #1 Two Sum
- leetcode 1:Two Sum
- LeetCode 1 Two Sum
- leetcode #1 two sum
- java循环结构汇总
- 关于动画过渡(Transition)
- 阿里巴巴 JAVA 开发手册
- hbase 源代码分析 (8) delete 过程 详解
- HDU5816 Hearthstone
- LeetCode(1) Two Sum
- ACM 优先队列和堆
- JavaScript基础
- jquery 无new 思想
- 22.系统广播-短信
- Java经典排序算法之冒泡排序
- 思绪整理
- sql
- php yii伪静态