题解 | 求峰谷点数

import sys
#
# 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
#
# 求序列a中的峰、谷点的个数
# @param a int整型一维数组 序列a
# @return int整型
#
class Solution:
    def countPeakPoint(self , a: List[int]) -> int:
        # write code here
        count = 0
        for i in range(len(a)-2):
            if a[i] < a[i+1] and a[i+2] < a[i+1]:
                count += 1
            if a[i] > a[i+1] and a[i+2] > a[i+1]:
                count += 1
        return count

if __name__ == "__main__":
    for line in sys.stdin:
        a = line.split()
        print(Solution.countPeakPoint(a))