文件: root - text - article - 2019 - 10 - two-sum.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | 英文 | 主页 | 类别: 计算机科学 | 1486 次阅读, 19145 次搜索 | 76 个单词
| 浏览 | 博客存档
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | 英文 | 主页 | 类别: 计算机科学 | 1486 次阅读, 19145 次搜索 | 76 个单词
| 浏览 | 博客存档
Hi, here's your problem today. This problem was recently asked by Facebook:
You are given a list of numbers, and a target number k. Return whether or not there are two numbers in the list that add up to k.
Example:
Given [4, 7, 1 , -3, 2] and k = 5,
return true since 4 + 1 = 5.
Try to do it in a single pass of the list.
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | 英文 | 主页 | 类别: 计算机科学 | 1486 次阅读, 19145 次搜索 | 76 个单词 You are given a list of numbers, and a target number k. Return whether or not there are two numbers in the list that add up to k.
Example:
Given [4, 7, 1 , -3, 2] and k = 5,
return true since 4 + 1 = 5.
def two_sum(list, k):
# Fill this in.
print two_sum([4,7,1,-3,2], 5)
# True
Try to do it in a single pass of the list.
猜您喜欢...
- Daily Interview Problem: First Missing Positive Integer
- Daily Interview Problem: Validate Binary Search Tree
- Daily Interview Problem: Merge List Of Number Into Ranges
- Two Tricks of Delphi
- Daily Interview Problem: Given two arrays, write a function to compute their intersection.
- Algorithm Interview Question: H-Index
- Algorithm Interview Question: Symmetric k-ary Tree
- Daily Interview Problem: Merge Overlapping Intervals
- Algorithm Interview: String Compression
- [Daily Problem] Move Zeros
©2006~2024 牛排过熟 - 0.00788 秒 - 2416.803 KB/s - 1068 在线 内存: 492.51 KB
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - 服务器 PHP 版本号: 7.4.33
牛排怎么做才好吃? | <meta name="机器人" content="索引, 跟踪">
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - 服务器 PHP 版本号: 7.4.33
评论 (0)
读写完全 - 一般 - 最小 - 表格 - 所有评论 - 统计
当前页暂时没有评论。