页面顶部 Top
文件:  root - text - article - 2019 - 10 - two-sum.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | 英文 | 主页 | 类别: 计算机科学 | 1229 次阅读, 15766 次搜索 | 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, | 英文 | 主页 | 类别: 计算机科学 | 1229 次阅读, 15766 次搜索 | 76 个单词 定阅此目录的博客

猜您喜欢...

  1. Daily Interview Problem: Merge Overlapping Intervals
  2. Sort a Partially Sorted List
  3. Daily Interview Problem: Merge K Sorted Linked Lists
  4. [Daily Problem] Longest Increasing Subsequence
  5. Daily Interview Question: Find Cycles in a Graph
  6. Maximum In A Stack
  7. Find Missing Numbers in an Array
  8. Multitasking
  9. Two Tricks of Delphi
  10. Skip the readings, focus on problems. And use all the hints!

评论 (0)

    当前页暂时没有评论。


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