Commit 981d032

raof01azl397985856

authored and

committed

feat: azl397985856#209: add C++ implementation (azl397985856#89)

1 parent a5e592f commit 981d032Copy full SHA for 981d032

File tree

+24

-0

lines changed

+24

-0

lines changed

Lines changed: 24 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -31,6 +31,10 @@ If you have figured out the O(n) solution, try coding another solution of which`
`31`	`31`
`32`	`32`	`## 代码`
`33`	`33`
	`34`	`+* 语言支持:JS,C++`
	`35`	`+`
	`36`	`+JavaScript Code:`
	`37`	`+`
`34`	`38`	```js
`35`	`39`	`/*`
`36`	`40`	`* @lc app=leetcode id=209 lang=javascript`
`@@ -93,6 +97,26 @@ var minSubArrayLen = function(s, nums) {`
`93`	`97`	`};`
`94`	`98`	```
`95`	`99`
	`100`	`+C++ Code:`
	`101`	+```C++
	`102`	`+class Solution {`
	`103`	`+public:`
	`104`	`+ int minSubArrayLen(int s, vector<int>& nums) {`
	`105`	`+ int num_len= nums.size();`
	`106`	`+ int left=0, right=0, total=0, min_len= num_len+1;`
	`107`	`+ while (right < num_len) {`
	`108`	`+ do {`
	`109`	`+ total += nums[right++];`
	`110`	`+ } while (right < num_len && total < s);`
	`111`	`+ while (left < right && total - nums[left] >= s) total -= nums[left++];`
	`112`	`+ if (total >=s && min_len > right - left)`
	`113`	`+ min_len = right- left;`
	`114`	`+ }`
	`115`	`+ return min_len <= num_len ? min_len: 0;`
	`116`	`+ }`
	`117`	`+};`
	`118`	+```
	`119`	`+`
`96`	`120`	`## 扩展`
`97`	`121`
`98`	`122`	`如果题目要求是 sum = s, 而不是 sum >= s 呢?`

Comments

(0)