文件: root - text - article - 2020 - 01 - subarray-with-target-sum.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 245 次阅读, 21729 次搜索 | 63 个单词
| 浏览 | 博客存档
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 245 次阅读, 21729 次搜索 | 63 个单词
| 浏览 | 博客存档Hi, here's your problem today. This problem was recently asked by Amazon:
You are given an array of integers, and an integer K. Return the subarray which sums to K. You can assume that a solution will always exist.
Can you do this in linear time?
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 245 次阅读, 21729 次搜索 | 63 个单词 You are given an array of integers, and an integer K. Return the subarray which sums to K. You can assume that a solution will always exist.
def find_continuous_k(list, k):
# Fill this in.
print find_continuous_k([1, 3, 2, 5, 7, 2], 14)
# [2, 5, 7]
Can you do this in linear time?
猜您喜欢...
- Plus One
- Daily Interview Problem: Word Ordering in a Different Alphabetical Order
- Algorithm Interview: Permutations of numbers
- Daily Interview Question: Create a Simple Calculator
- Design Tic-Tac-Toe
- Delphi Dynamic Array
- Daily Interview Problem: Queue Using Two Stacks
- Sorting a list with 3 unique numbers
- First and Last Indices of an Element in a Sorted Array
- Daily Interview Problem: Deepest Node in a Binary Tree
最后更新: October 30 2020 14:21:12 |
©2006~2024 牛排过熟 - 0.02824 秒 - 697.718 KB/s - 57 在线 
内存: 492.77 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="不索引, 跟踪" />
内存: 492.77 KB18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - 服务器 PHP 版本号: 7.4.33
读写完全 - 一般 - 最小 - 表格 - 所有评论 - 统计
当前页暂时没有评论。