文件: root - text - article - 2019 - 11 - minimum-size-subarray-sum.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, | 英文 | 主页 | 类别: 计算机科学 | 398 次阅读, 18193 次搜索 | 81 个单词
| 浏览 | 博客存档
![定阅此目录的博客 定阅此目录的博客](/images/form/rss.gif)
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, | 英文 | 主页 | 类别: 计算机科学 | 398 次阅读, 18193 次搜索 | 81 个单词
![定阅此目录的博客 定阅此目录的博客](/images/form/rss.gif)
Hi, here's your problem today. This problem was recently asked by Amazon:
Given an array of n positive integers and a positive integer s, find the minimal length of a contiguous subarray of which the sum ≥ s. If there isn't one, return 0 instead.
Example:
Input: s = 7, nums = [2,3,1,2,4,3]
Output: 2
Explanation: the subarray [4,3] has the minimal length under the problem constraint.
Here is the method signature:
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, | 英文 | 主页 | 类别: 计算机科学 | 398 次阅读, 18193 次搜索 | 81 个单词 Given an array of n positive integers and a positive integer s, find the minimal length of a contiguous subarray of which the sum ≥ s. If there isn't one, return 0 instead.
Example:
Input: s = 7, nums = [2,3,1,2,4,3]
Output: 2
Explanation: the subarray [4,3] has the minimal length under the problem constraint.
Here is the method signature:
class Solution:
def minSubArrayLen(self, nums, s):
# Fill this in
print Solution().minSubArrayLen([2, 3, 1, 2, 4, 3], 7)
# 2
![定阅此目录的博客 定阅此目录的博客](/images/form/rss.gif)
猜您喜欢...
- Daily Interview Question: Longest Sequence with Two Unique Numbers
- [Daily Problem] Angles of a Clock
- [Daily Problem] Move Zeros
- Daily Interview Question: Edit Distance
- Design Tic-Tac-Toe
- Daily Interview Problem: Largest Product of 3 Elements I
- Daily Interview Problem: Given two arrays, write a function to compute their intersection.
- Windows Scripting
- Algorithm Interview: String Compression
- [Daily Problem] Add two numbers as a linked list
©2006~2024 牛排过熟 - 0.01019 秒 - 1895.072 KB/s - 16 在线
内存: 492.88 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="不索引, 跟踪" />
![](/images/top.jpg)
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - 服务器 PHP 版本号: 7.4.33
读写完全 - 一般 - 最小 - 表格 - 所有评论 - 统计
当前页暂时没有评论。