209. \u957f\u5ea6\u6700\u5c0f\u7684\u5b50\u6570\u7ec4 – \u529b\u6263（LeetCode）<\/p>\n
class Solution {
\npublic:
\n int minSubArrayLen(int target, vector<int>& nums) {
\n int left=0,right=0,sum=0,length=INT_MAX;
\n while(right<nums.size())
\n {
\n while(right<nums.size()&&sum<target)
\n {
\n sum+=nums[right];
\n right++;
\n }
\n if(sum>target)
\n length=min(length,right-left);
\n while(sum>=target)
\n {
\n length=min(length,right-left);
\n sum-=nums[left];
\n left++;
\n }
\n }
\n return length==INT_MAX?0:length;
\n }
\n}; <\/p>\n
2302. \u7edf\u8ba1\u5f97\u5206\u5c0f\u4e8e K \u7684\u5b50\u6570\u7ec4\u6570\u76ee – \u529b\u6263（LeetCode）<\/p>\n
class Solution {
\npublic:
\n long long countSubarrays(vector<int>& nums, long long k) {
\n long long res = 0, cnt = 0;
\n int n = nums.size(), left = 0, right = 0;
\n while (right < n)
\n {
\n while (right < n && cnt < k)
\n {
\n if (right > left)
\n cnt \/= right – left;
\n cnt += nums[right];
\n cnt *= right – left + 1;
\n right++;
\n }
\n if (cnt >= k)res += n – right + 1;
\n while (cnt >= k)
\n {
\n if (right > left)
\n cnt \/= right – left;
\n cnt -= nums[left];
\n cnt *= right – left – 1;
\n left++;
\n if(cnt>=k)
\n res += n – right + 1;
\n }
\n }
\n return (long long)n*(n+1)\/2-res;
\n }
\n}; <\/p>\n
\u00a0（1）\u8bbe\u7f6e\u6ed1\u52a8\u7a97\u53e3\u5de6\u53f3\u7a97\u53e3\u521d\u59cb\u503c\u5747\u4e3a0，\u7136\u540e\u53f3\u533a\u95f4\u5f00\u59cb\u79fb\u52a8，\u76f4\u81f3\u627e\u5230\u6ee1\u8db3\u6761\u4ef6\u7684\u533a\u95f4\u6216\u6765\u5230\u6570\u7ec4\u672b\u5c3e\u3002<\/p>\n
（2）\u5982\u679c\u5f53\u524d\u533a\u95f4\u7b26\u5408\u6761\u4ef6，\u5219\u6dfb\u52a0\u5230\u7ed3\u679c\u4e2d\u3002\u5bf9\u4e8e2302\u6765\u8bf4，\u5f53\u524d\u533a\u95f4\u6ee1\u8db3，\u5219\u540e\u9762\u7684\u533a\u95f4\u4e00\u5b9a\u90fd\u6ee1\u8db3，\u66f4\u65b0\u7ed3\u679c\u3002<\/p>\n
（3）\u79fb\u52a8\u5de6\u7a97\u53e3，\u76f4\u81f3\u4e0d\u6ee1\u8db3\u6761\u4ef6\u3002\u79fb\u52a8\u7684\u8fc7\u7a0b\u4e2d，\u53ea\u8981\u79fb\u52a8\u4e00\u6b21\u4ecd\u7136\u6ee1\u8db3\u6761\u4ef6，\u5219\u627e\u5230\u4e86\u4e00\u4e2a\u6ee1\u8db3\u6761\u4ef6\u7684\u7a97\u53e3，\u66f4\u65b0\u7ed3\u679c\u3002<\/p>\n","protected":false},"excerpt":{"rendered":"
\u6587\u7ae0\u6d4f\u89c8\u9605\u8bfb111\u6b21\u3002\uff083\uff09\u79fb\u52a8\u5de6\u7a97\u53e3\uff0c\u76f4\u81f3\u4e0d\u6ee1\u8db3\u6761\u4ef6\u3002\u79fb\u52a8\u7684\u8fc7\u7a0b\u4e2d\uff0c\u53ea\u8981\u79fb\u52a8\u4e00\u6b21\u4ecd\u7136\u6ee1\u8db3\u6761\u4ef6\uff0c\u5219\u627e\u5230\u4e86\u4e00\u4e2a\u6ee1\u8db3\u6761\u4ef6\u7684\u7a97\u53e3\uff0c\u66f4\u65b0\u7ed3\u679c\u3002\uff082\uff09\u5982\u679c\u5f53\u524d\u533a\u95f4\u7b26\u5408\u6761\u4ef6\uff0c\u5219\u6dfb\u52a0\u5230\u7ed3\u679c\u4e2d\u3002\u5bf9\u4e8e2302\u6765\u8bf4\uff0c\u5f53\u524d\u533a\u95f4\u6ee1\u8db3\uff0c\u5219\u540e\u9762\u7684\u533a\u95f4\u4e00\u5b9a\u90fd\u6ee1\u8db3\uff0c\u66f4\u65b0\u7ed3\u679c\u3002\uff081\uff09\u8bbe\u7f6e\u6ed1\u52a8\u7a97\u53e3\u5de6\u53f3\u7a97\u53e3\u521d\u59cb\u503c\u5747\u4e3a0\uff0c\u7136\u540e\u53f3\u533a\u95f4\u5f00\u59cb\u79fb\u52a8\uff0c\u76f4\u81f3\u627e\u5230\u6ee1\u8db3\u6761\u4ef6\u7684\u533a\u95f4\u6216\u6765\u5230\u6570\u7ec4\u672b\u5c3e\u3002<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[55,1813,427],"topic":[],"class_list":["post-34264","post","type-post","status-publish","format-standard","hentry","category-server","tag-c","tag-1813","tag-427"],"yoast_head":"\n