Python3 解法, 执行用时: 561ms, 内存消耗: 61452K, 提交时间: 2023-08-11 17:06:22

#
# 
# @param arr int整型一维数组 
# @return int整型
#
class Solution:
    def Answerofjudge(self , arr ):
        # write code here
        arr.sort()
        half = len(arr) // 2
        a=(arr[half] + arr[~half])/2
        b=sum(arr)/len(arr)
        if a>b: return 1
        elif a<b: return -1
        else: return 0

Java 解法, 执行用时: 813ms, 内存消耗: 130716K, 提交时间: 2023-08-11 17:04:56

import java.util.*;

public class Solution {
    public int Answerofjudge (int[] arr) {
        long s = 0;
        for(int a:arr) s+= a;
        
        Arrays.sort(arr);
        int i = arr.length/2;
        long cmp = arr[i];
        if(arr.length%2==0){
            cmp += arr[i-1];
        }
        
        cmp = (long)cmp*arr.length;
        return Long.compare(cmp,2L*s);
    }
}