algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-10 04:06:51 +08:00
Code Issues Packages Projects Releases Wiki Activity

添加 0122.买卖股票的最佳时机II.md Scala版本

Browse Source
This commit is contained in:
ZongqinWang
2022-06-11 16:53:35 +08:00
parent 9031523bbb
commit ff233a8e3c
1 changed files with 27 additions and 8 deletions
Download Patch File Download Diff File Expand all files Collapse all files

35
problems/0122.买卖股票的最佳时机II.md
View File

@ -133,8 +133,9 @@ public:
## 其他语言版本 ## 其他语言版本
Java: ### Java:
贪心:
```java ```java
// 贪心思路 // 贪心思路
class Solution { class Solution {
@ -148,6 +149,7 @@ class Solution {
} }
``` ```
动态规划:
```java ```java
class Solution { // 动态规划 class Solution { // 动态规划
public int maxProfit(int[] prices) { public int maxProfit(int[] prices) {
@ -169,8 +171,8 @@ class Solution { // 动态规划
} }
``` ```
Python: ### Python:
贪心:
```python ```python
class Solution: class Solution:
def maxProfit(self, prices: List[int]) -> int: def maxProfit(self, prices: List[int]) -> int:
@ -180,7 +182,7 @@ class Solution:
return result return result
``` ```
python动态规划 动态规划:
```python ```python
class Solution: class Solution:
def maxProfit(self, prices: List[int]) -> int: def maxProfit(self, prices: List[int]) -> int:
@ -194,7 +196,7 @@ class Solution:
return dp[-1][1] return dp[-1][1]
``` ```
Go: ### Go:
```golang ```golang
//贪心算法 //贪心算法
@ -231,7 +233,7 @@ func maxProfit(prices []int) int {
} }
``` ```
Javascript: ### Javascript:
贪心 贪心
```Javascript ```Javascript
@ -268,7 +270,7 @@ const maxProfit = (prices) => {
}; };
``` ```
TypeScript： ### TypeScript：
```typescript ```typescript
function maxProfit(prices: number[]): number { function maxProfit(prices: number[]): number {
@ -280,7 +282,7 @@ function maxProfit(prices: number[]): number {
}; };
``` ```
C: ### C:
贪心： 贪心：
```c ```c
int maxProfit(int* prices, int pricesSize){ int maxProfit(int* prices, int pricesSize){
@ -318,5 +320,22 @@ int maxProfit(int* prices, int pricesSize){
} }
``` ```
### Scala
贪心:
```scala
object Solution {
def maxProfit(prices: Array[Int]): Int = {
var result = 0
for (i <- 1 until prices.length) {
if (prices(i) > prices(i - 1)) {
result += prices(i) - prices(i - 1)
}
}
result
}
}
```
----------------------- -----------------------
<div align="center"><img src=https://code-thinking.cdn.bcebos.com/pics/01二维码一.jpg width=500> </img></div> <div align="center"><img src=https://code-thinking.cdn.bcebos.com/pics/01二维码一.jpg width=500> </img></div>