Algorithm
Check if Array is Good
Solution
class Solution:
def isGood(self, nums: List[int]) -> bool:
n = len(nums)
count = [0] * n
for a in nums:
if a >= n:
return False
if a < n - 1 and count[a] > 0:
return False
if a == n - 1 and count[a] > 1:
return False
count[a] += 1
return TrueVideo GuideLeetcode Daily
Time Complexity
O(n log n)
Space Complexity
O(log n)
