题目描述
blablabla
样例
blablabla
算法1
(暴力枚举) $O(n^2)$
blablabla
时间复杂度
参考文献
python3 代码
def sumOfBeauties(self, nums: List[int]) -> int:
n =len(nums)
L = [0] * n
L[0] = nums[0]
R = [0] * n
R[n-1] = nums[-1]
for i in range(1,n-1):
if nums[i] >= L[i-1]:
L[i] = nums[i]
else:
L[i] = L[i-1]
for i in range(n-2,-1,-1):
if nums[i] <= R[i+1]:
R[i] = nums[i]
else:
R[i] = R[i+1]
res = 0
for i in range(1,n-1):
if nums[i] > L[i-1] and nums[i] < R[i+1]:
res += 2
elif nums[i] > nums[i-1] and nums[i] < nums[i+1]:
res += 1
return res
算法2
(暴力枚举) $O(n^2)$
blablabla
时间复杂度
参考文献
C++ 代码
blablabla