Skip to content

Commit 4cec106

Browse files
Merge pull request #414 from fusunx/master
0738.单调递增的数字.md Javascript && 0714.买卖股票的最佳时机.md Javascript && 0968.监控二叉树.md Javascript
2 parents 05e5577 + 8496fe9 commit 4cec106

File tree

3 files changed

+80
-0
lines changed

3 files changed

+80
-0
lines changed

problems/0714.买卖股票的最佳时机含手续费.md

Lines changed: 22 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -217,7 +217,29 @@ class Solution: # 贪心思路
217217

218218
Go:
219219

220+
Javascript:
221+
```Javascript
222+
// 贪心思路
223+
var maxProfit = function(prices, fee) {
224+
let result = 0
225+
let minPrice = prices[0]
226+
for(let i = 1; i < prices.length; i++) {
227+
if(prices[i] < minPrice) {
228+
minPrice = prices[i]
229+
}
230+
if(prices[i] >= minPrice && prices[i] <= minPrice + fee) {
231+
continue
232+
}
220233

234+
if(prices[i] > minPrice + fee) {
235+
result += prices[i] - minPrice - fee
236+
// 买入和卖出只需要支付一次手续费
237+
minPrice = prices[i] -fee
238+
}
239+
}
240+
return result
241+
};
242+
```
221243

222244

223245
-----------------------

problems/0738.单调递增的数字.md

Lines changed: 23 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -163,7 +163,30 @@ class Solution:
163163

164164
Go:
165165

166+
Javascript:
167+
```Javascript
168+
var monotoneIncreasingDigits = function(n) {
169+
n = n.toString()
170+
n = n.split('').map(item => {
171+
return +item
172+
})
173+
let flag = Infinity
174+
for(let i = n.length - 1; i > 0; i--) {
175+
if(n [i - 1] > n[i]) {
176+
flag = i
177+
n[i - 1] = n[i - 1] - 1
178+
n[i] = 9
179+
}
180+
}
181+
182+
for(let i = flag; i < n.length; i++) {
183+
n[i] = 9
184+
}
166185

186+
n = n.join('')
187+
return +n
188+
};
189+
```
167190

168191

169192
-----------------------

problems/0968.监控二叉树.md

Lines changed: 35 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -369,7 +369,42 @@ class Solution:
369369
```
370370
Go:
371371

372+
Javascript:
373+
```Javascript
374+
var minCameraCover = function(root) {
375+
let result = 0
376+
function traversal(cur) {
377+
if(cur === null) {
378+
return 2
379+
}
380+
381+
let left = traversal(cur.left)
382+
let right = traversal(cur.right)
383+
384+
if(left === 2 && right === 2) {
385+
return 0
386+
}
387+
388+
if(left === 0 || right === 0) {
389+
result++
390+
return 1
391+
}
392+
393+
if(left === 1 || right === 1) {
394+
return 2
395+
}
396+
397+
return -1
398+
}
372399

400+
if(traversal(root) === 0) {
401+
result++
402+
}
403+
404+
return result
405+
406+
};
407+
```
373408

374409

375410
-----------------------

0 commit comments

Comments
 (0)