• 【leetcode】1630. Arithmetic Subarrays


    题目如下:

    A sequence of numbers is called arithmetic if it consists of at least two elements, and the difference between every two consecutive elements is the same. More formally, a sequence s is arithmetic if and only if s[i+1] - s[i] == s[1] - s[0] for all valid i.

    For example, these are arithmetic sequences:

    1, 3, 5, 7, 9
    7, 7, 7, 7
    3, -1, -5, -9

    The following sequence is not arithmetic:

    1, 1, 2, 5, 7

    You are given an array of n integers, nums, and two arrays of m integers each, l and r, representing the m range queries, where the ith query is the range [l[i], r[i]]. All the arrays are 0-indexed.

    Return a list of boolean elements answer, where answer[i] is true if the subarray nums[l[i]], nums[l[i]+1], ... , nums[r[i]] can be rearranged to form an arithmetic sequence, and false otherwise.

    Example 1:

    Input: nums = [4,6,5,9,3,7], l = [0,0,2], r = [2,3,5]
    Output: [true,false,true]
    Explanation:
    In the 0th query, the subarray is [4,6,5]. This can be rearranged as [6,5,4], which is an arithmetic sequence.
    In the 1st query, the subarray is [4,6,5,9]. This cannot be rearranged as an arithmetic sequence.
    In the 2nd query, the subarray is [5,9,3,7]. This can be rearranged as [3,5,7,9], which is an arithmetic sequence.

    Example 2:

    Input: nums = [-12,-9,-3,-12,-6,15,20,-25,-20,-15,-10], l = [0,1,6,4,8,7], r = [4,4,9,7,9,10]
    Output: [false,true,false,false,true,true]

    Constraints:

    • n == nums.length
    • m == l.length
    • m == r.length
    • 2 <= n <= 500
    • 1 <= m <= 500
    • 0 <= l[i] < r[i] < n
    • -105 <= nums[i] <= 105

    解题思路:本题似乎对性能要求不高,直接计算即可。

    代码如下:

    class Solution(object):
        def checkArithmeticSubarrays(self, nums, l, r):
            """
            :type nums: List[int]
            :type l: List[int]
            :type r: List[int]
            :rtype: List[bool]
            """
            def isArithmetic(arr):
                diff = arr[1] - arr[0]
                for i in range(2,len(arr)):
                    if arr[i] - arr[i-1] != diff:
                        return False
                return True
    
            res = []
            for (start,end) in zip(l,r):
                res.append(isArithmetic(sorted(nums[start:end+1])))
    
            return res
  • 相关阅读:
    Tempter of the Bone 搜索---奇偶性剪枝
    uestc 1709 Binary Operations 位运算的灵活运用
    uestc 1072 a ^ b
    uestc Another LCIS
    武汉邀请赛 Key Logger 双向链表
    bnu 29378 Adidas vs Adivon 基础题
    中南月赛F ZZY and his little friends
    日期问题
    开灯问题
    开灯问题
  • 原文地址:https://www.cnblogs.com/seyjs/p/14931252.html
Copyright © 2020-2023  润新知