2023.11.24 Today's Challenge

https://leetcode.com/problems/arithmetic-subarrays/

Arithmetic Subarrays - LeetCode

오랫만에 짧은 시간동안 스스로 풀어봄

class Solution:
    def checkArithmeticSubarrays(self, nums: List[int], l: List[int], r: List[int]) -> List[bool]:
        result = []
        for i in range(len(l)):
            num = nums[l[i]:r[i]+1]
            num.sort()
            if len(num) < 2:
                result.append(True)
                continue
            diff = num[1] - num[0]
            is_found = False
            for j in range(len(num) - 1):
                if num[j+1] - num[j] != diff:
                    result.append(False)
                    is_found = True
                    break
            if not is_found:
                result.append(True)
        return result