Python C++單迴圈速解Leetcode 3105 Longest Strictly Increasing or Strictly De...

Python cpp單迴圈速解Leetcode 3105  Longest Strictly Increasing or Strictly Decreasing Subarray

用單迴圈就可解，甚至也沒有用到if, switch, tenary

[Py3解請進]

------------

It can be solved with a single loop, without even using if, switch, tenary

[codes on Leetcode]https://leetcode.com/problems/longest-strictly-increasing-or-strictly-decreasing-subarray/solutions/6364719/1-pass-less-branch-c-py3-beats-100/

[Leetcode Playlist]https://www.youtube.com/watch?v=NayZG_FnMzE&list=PLYRlUBnWnd5IdDHk2BjqXwesydU17z_x

class Solution:
    def longestMonotonicSubarray(self, nums: List[int]) -> int:
        n, ans, inc, dec=len(nums), 1, 1, 1
        for i in range(1, n):
            A=nums[i]>nums[i-1]
            B=nums[i]<nums[i-1]
            inc=A*inc+1
            dec=B*dec+1
            ans=max(ans, dec, inc)
        return ans