LeetCode解题分享：1093. Statistics from a Large Sample

Problem

We sampled integers between 0 and 255, and stored the results in an array count: count[k] is the number of integers we sampled equal to k.

Return the minimum, maximum, mean, median, and mode of the sample respectively, as an array of floating point numbers. The mode is guaranteed to be unique.

(Recall that the median of a sample is:

The middle element, if the elements of the sample were sorted and the number of elements is odd;
The average of the middle two elements, if the elements of the sample were sorted and the number of elements is even.)

Example 1:

Input: 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]
Output: [1.00000,3.00000,2.37500,2.50000,3.00000]

Example 2:

Input: 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]
Output: [1.00000,4.00000,2.18182,2.00000,1.00000]

Constraints:

1. count.length == 256
2. 1 <= sum(count) <= 10^9
3. The mode of the sample that count represents is unique.
4. Answers within 10^-5 of the true value will be accepted as correct.

解题思路

   这一题让我们分别求解给定数据的最小值， 最大值，均值，中位数和众数。需要注意的是数据的采样范围是0~255，给出的数据是采样频率。
   最小值，最大值，均值，众数可以在同一次遍历过程中求解，而中位数在一般情况下需要在两层循环中求解，第一层循环计算所有数据的总数目，并计算中点的位置，这一层可以和求解最大值等的循环共用。第二层循环则是循环遍历，直到越过或刚好抵达中点处，然后在求解中位数。另外需要注意的是，中位数的求法和数据总数的奇偶有关。

   代码如下：

class Solution:
    def sampleStats(self, count) -> list:
        minimum = 255
        maximum = 0
        mode = 0
        average = 0
        cnt = 0

        median = None

        for i in range(len(count)):
            if count[i] != 0:
                minimum = min(minimum, i)
                maximum = max(maximum, i)
            if count[i] > count[mode]:
                mode = i

            average += i * count[i]
            cnt += count[i]

        average = average * 1.0 / cnt
        mid = cnt // 2

        pos = 0
        for i in range(len(count)):
            pos += count[i]
            if pos == mid:
                if cnt % 2 == 1:
                    median = i
                else:
                    j = i + 1
                    while count[j] == 0:
                        j += 1
                    median = (i + j) / 2.0
                    break
            if pos > mid:
                median = i
                break

        return [minimum * 1.0, maximum * 1.0, average * 1.0, median * 1.0, mode * 1.0]