Re: [閒聊] 每日LeetCode已回收
https://leetcode.com/problems/can-make-arithmetic-progression-from-sequence/description/
給你一個陣列判斷他有沒有辦法透過重新排列組成一個所有數字相差的值都一樣的序列。
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.
思路：
1.排序之後兩個兩個檢查是不是都一樣就好==
Java Code：
--------------------------------------------
class Solution {
public boolean canMakeArithmeticProgression(int[] arr) {
Arrays.sort(arr);
int dif = arr[1] - arr[0];
for (int i = 2; i < arr.length; i++) {
if (arr[i] - arr[i - 1] != dif) {
return false;
}
}
return true;
}
}
--------------------------------------------
--
https://i.imgur.com/sjdGOE3.jpg
--
※ 發信站: 批踢踢實業坊(ptt.cc), 來自: 122.100.75.86 (臺灣)
※ 文章網址: https://www.ptt.cc/bbs/Marginalman/M.1686072065.A.DCA.html
討論串 (同標題文章)
完整討論串 (本文為第 338 之 719 篇)：