Untitled
user_2681560
plain_text
2 years ago
504 B
20
Indexable
class Solution: # @param A : list of integers # @return an integer def solve(self, A): n = len(A) if n == 1: return 1 for i in range(n-1, -1, -1): j = n-1-i while j < n-1 and A[j] >= A[j+1]: if abs(A[j] - A[j+1]) == 1: A[j], A[j+1] = A[j+1], A[j] j += 1 for i in range(n-1): if A[i] > A[i+1]: return 0 return 1
Editor is loading...