Merge pull request #414 from fusunx/master

0738.单调递增的数字.md Javascript  &&  0714.买卖股票的最佳时机.md Javascript && 0968.监控二叉树.md Javascript
This commit is contained in:
程序员Carl
2021-06-21 20:58:14 +08:00
committed by GitHub
3 changed files with 80 additions and 0 deletions

View File

@ -217,7 +217,29 @@ class Solution: # 贪心思路
Go
Javascript:
```Javascript
// 贪心思路
var maxProfit = function(prices, fee) {
let result = 0
let minPrice = prices[0]
for(let i = 1; i < prices.length; i++) {
if(prices[i] < minPrice) {
minPrice = prices[i]
}
if(prices[i] >= minPrice && prices[i] <= minPrice + fee) {
continue
}
if(prices[i] > minPrice + fee) {
result += prices[i] - minPrice - fee
// 买入和卖出只需要支付一次手续费
minPrice = prices[i] -fee
}
}
return result
};
```
-----------------------

View File

@ -163,7 +163,30 @@ class Solution:
Go
Javascript:
```Javascript
var monotoneIncreasingDigits = function(n) {
n = n.toString()
n = n.split('').map(item => {
return +item
})
let flag = Infinity
for(let i = n.length - 1; i > 0; i--) {
if(n [i - 1] > n[i]) {
flag = i
n[i - 1] = n[i - 1] - 1
n[i] = 9
}
}
for(let i = flag; i < n.length; i++) {
n[i] = 9
}
n = n.join('')
return +n
};
```
-----------------------

View File

@ -369,7 +369,42 @@ class Solution:
```
Go
Javascript:
```Javascript
var minCameraCover = function(root) {
let result = 0
function traversal(cur) {
if(cur === null) {
return 2
}
let left = traversal(cur.left)
let right = traversal(cur.right)
if(left === 2 && right === 2) {
return 0
}
if(left === 0 || right === 0) {
result++
return 1
}
if(left === 1 || right === 1) {
return 2
}
return -1
}
if(traversal(root) === 0) {
result++
}
return result
};
```
-----------------------