我是靠谱客的博主 玩命短靴,最近开发中收集的这篇文章主要介绍LeetCode --- 1502. Can Make Arithmetic Progression From Sequence 解题报告,觉得挺不错的,现在分享给大家,希望可以做个参考。

概述

A sequence of numbers is called an arithmetic progression if the difference between any two consecutive elements is the same.

Given an array of numbers arr, return true if the array can be rearranged to form an arithmetic progression. Otherwise, return false.

Example 1:

Input: arr = [3,5,1]
Output: true
Explanation: We can reorder the elements as [1,3,5] or [5,3,1] with differences 2 and -2 respectively, between each consecutive elements.

Example 2:

Input: arr = [1,2,4]
Output: false
Explanation: There is no way to reorder the elements to obtain an arithmetic progression.

Constraints:

  • 2 <= arr.length <= 1000
  • -106 <

最后

以上就是玩命短靴为你收集整理的LeetCode --- 1502. Can Make Arithmetic Progression From Sequence 解题报告的全部内容,希望文章能够帮你解决LeetCode --- 1502. Can Make Arithmetic Progression From Sequence 解题报告所遇到的程序开发问题。

如果觉得靠谱客网站的内容还不错,欢迎将靠谱客网站推荐给程序员好友。

本图文内容来源于网友提供,作为学习参考使用,或来自网络收集整理,版权属于原作者所有。
点赞(80)

评论列表共有 0 条评论

立即
投稿
返回
顶部