页面顶部 Top
文件:  root - text - article - 2019 - 10 - two-sum.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | 英文 | 主页 | 类别: 计算机科学 | 1231 次阅读, 15820 次搜索 | 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.


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 Problem, Data Structures and Algorithms, | 英文 | 主页 | 类别: 计算机科学 | 1231 次阅读, 15820 次搜索 | 76 个单词 定阅此目录的博客

猜您喜欢...

  1. Algorithm Interview Question: Find the Single Element in an Array of Duplicates
  2. Binary Tree Level with Minimum Sum
  3. Most Frequent Subtree Sum
  4. Palindrome Integers
  5. Two Tricks of Delphi
  6. Algorithm Interview: Permutations of numbers
  7. Daily Interview Problem: Merge K Sorted Linked Lists
  8. Daily Interview Problem: Longest Substring With K Distinct Characters
  9. Algorithm Interview: Lowest Common Ancestor of 2 Nodes in Binary Tree
  10. Daily Interview Problem: Largest BST in a Binary Tree

评论 (0)

您的邮件 (不公开域名部分):

您的评论:

悄悄话(发邮件) 颜色 更多笑脸 S x y @

验证码 (点击图片更新):

    当前页暂时没有评论。


最后更新: October 30 2020 14:21:12 | RSS Subscription
牛排怎么做才好吃? | <meta name="机器人" content="不索引, 跟踪" />