Algorithm
Total Waviness of Numbers in Range I
Solution
class Solution:
def sumOfWaviness(self, num1: int, num2: int) -> int:
total_waviness = 0
for i in range(num1, num2 + 1):
s = str(i)
n = len(s)
if n < 3:
continue
for j in range(1, n - 1):
if s[j] > s[j-1] and s[j] > s[j+1]:
total_waviness += 1
elif s[j] < s[j-1] and s[j] < s[j+1]:
total_waviness += 1
return total_wavinessVideo GuideLeetcode Daily
Time Complexity
O(N L)
Space Complexity
O(L)
