mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-10 20:40:39 +08:00
添加 0376.摆动序列.md Scala版本
This commit is contained in:
@ -375,7 +375,31 @@ function wiggleMaxLength(nums: number[]): number {
|
||||
};
|
||||
```
|
||||
|
||||
### Scala
|
||||
|
||||
```scala
|
||||
object Solution {
|
||||
def wiggleMaxLength(nums: Array[Int]): Int = {
|
||||
if (nums.length <= 1) return nums.length
|
||||
var result = 1
|
||||
var curDiff = 0 // 当前一对的差值
|
||||
var preDiff = 0 // 前一对的差值
|
||||
|
||||
for (i <- 1 until nums.length) {
|
||||
curDiff = nums(i) - nums(i - 1) // 计算当前这一对的差值
|
||||
// 当 curDiff > 0 的情况,preDiff <= 0
|
||||
// 当 curDiff < 0 的情况,preDiff >= 0
|
||||
// 这两种情况算是两个峰值
|
||||
if ((curDiff > 0 && preDiff <= 0) || (curDiff < 0 && preDiff >= 0)) {
|
||||
result += 1 // 结果集加 1
|
||||
preDiff = curDiff // 当前差值赋值给上一轮
|
||||
}
|
||||
}
|
||||
|
||||
result
|
||||
}
|
||||
}
|
||||
```
|
||||
|
||||
-----------------------
|
||||
<div align="center"><img src=https://code-thinking.cdn.bcebos.com/pics/01二维码一.jpg width=500> </img></div>
|
||||
|
Reference in New Issue
Block a user