leetcode805. Split Array With Same Average
原题地址:https://leetcode.com/problems/split-array-with-same-average/
题目
In a given integer array A, we must move every element of A to either list B or list C. (B and C initially start empty.)
Return true if and only if after such a move, it is possible that the average value of B is equal to the average value of C, and B and C are both non-empty.
Example :
Input:
[1,2,3,4,5,6,7,8]
Output: true
Explanation: We can split the array into [1,4,5,8] and [2,3,6,7], and both of them have the average of 4.5.
Note:
- The length of A will be in the range [1, 30].
- A[i] will be in the range of [0, 10000].
python代码
class Solution:
def splitArraySameAverage(self, A):
"""
:type A: List[int]
:rtype: bool
"""
def satisfied(num, i, n):
if i == 0:
if num == 0:
return True
else:
return False
if i+n > len(A):
return False
return satisfied(num-A[n], i-1, n+1) or satisfied(num, i, n+1)
if len(A) == 0 or len(A) == 1:
return False
aver = sum(A) / len(A)
A.sort()
for i in range(1, len(A)//2+1):
if i*sum(A)%len(A)==0:
if satisfied(i*aver, i, 0):
return True
return False
版权声明:转载注明 http://blog.csdn.net/birdreamer/article/details/79690785