#Leetcode1752 rotated Sorted| C++1 pass |Py3 #1line |0ms
[Py3 1-liner請進]
class Solution:
def check(self, nums: List[int]) -> bool:
return (cntD:=sum(y < x for x, y in pairwise(nums)))== 0 or (cntD 1 and nums[-1]<=nums[0])
/* 自定義代碼塊樣式 */
沒有留言:
張貼留言