LeetCode 1093. 大样本统计

最新推荐文章于 2023-05-23 13:47:35 发布

Guapifang

最新推荐文章于 2023-05-23 13:47:35 发布

阅读量105

点赞数

分类专栏： LeetCode 文章标签： leetcode 算法

本文链接：https://blog.csdn.net/weixin_43918046/article/details/120675631

版权

LeetCode 专栏收录该内容

481 篇文章 5 订阅

订阅专栏

大样本统计

我们对 0 到 255 之间的整数进行采样，并将结果存储在数组 count 中：count[k] 就是整数 k 的采样个数。

我们以浮点数数组的形式，分别返回样本的最小值、最大值、平均值、中位数和众数。其中，众数是保证唯一的。

我们先来回顾一下中位数的知识：

如果样本中的元素有序，并且元素数量为奇数时，中位数为最中间的那个元素；
如果样本中的元素有序，并且元素数量为偶数时，中位数为中间的两个元素的平均值。

示例 1：

输入：count = [0,1,3,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
输出：[1.00000,3.00000,2.37500,2.50000,3.00000]

示例 2：

输入：count = [0,4,3,2,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
输出：[1.00000,4.00000,2.18182,2.00000,1.00000]

提示：

count.length == 256
1 <= sum(count) <= 10^9
计数表示的众数是唯一的
答案与真实值误差在 10^-5 以内就会被视为正确答案

题解

无聊的题目。。。。。

class Solution {
public:
    typedef long long ll;
    ll sum[300];
    vector<double> sampleStats(vector<int>& count) 
    {
        sum[0] = count[0];
        ll mi=1e9,mx=-1e9,ans=0,id=0;
        ll total = 0;
        if(count[0]>0)
        {
            mi=min(mi,(ll)0);
            mx=max(mx,(ll)0);
            ans=count[0];
            id=0;
        }
        for(int i=1;i<count.size();i++)
        {
            sum[i] = sum[i-1]+count[i];
            if(count[i]>0)
            {
                total += (ll)count[i]*(ll)i;
                mi=min(mi,(ll)i);
                mx=max(mx,(ll)i);
                if(count[i]>ans)
                {
                    ans=count[i];
                    id=i;                        
                }
            }
        }
        double aver = 0;
        if(sum[count.size()-1]%2==1)
        {
            int mid=sum[count.size()-1]/2+1;
            for(int i=0;i<count.size()-1;i++)
            {
                if(sum[i]>=mid)
                {
                    aver=i;
                    break;
                } 
            }
        }
        else
        {
            int mid=sum[count.size()-1]/2;
            for(int i=0;i<count.size()-1;i++)
            {
                if(sum[i]>=mid)
                {
                    aver=i;
                    if(sum[i]==mid)//需要再找一个
                    {
                        for(int j=i+1;j<count.size();j++)
                        {
                            if(count[j]>0)
                            {
                                aver+=j;
                                break;
                            }
                        }
                        aver/=2;
                    }
                    break;
                } 
            }    
            
        }
        vector<double>res;
        res.push_back(double(mi));
        res.push_back(double(mx));
        res.push_back(double(total)/double(sum[count.size()-1]));
        res.push_back(aver);
        res.push_back(double(id));
        return res;
    }
};