用python写下方的代码，下方函数求得一个列表numbers中的众数，思路如下：1）用count()计算列表 numbers中每个元素出现的次数2）将上述元素和对应的出现次数存入字典，count_num中；3）用max()找到count_num中最大的值，并找到拥有该值的字典键添加到max_count_num中； 4）max_count_num中的元素就是众数，count_num 是众数 出现的次数。

以下是Python代码实现：

def find_mode(numbers):
count_num = {}
max_count_num = []
max_count = 0

for num in numbers:
if num in count_num:
count_num[num] += 1
else:
count_num[num] = 1

for key, value in count_num.items():
if value > max_count:
max_count = value
max_count_num = [key]
elif value == max_count:
max_count_num.append(key)

return max_count_num, max_count

# 示例使用
numbers_example = [1, 2, 2, 3, 4, 4, 4]
mode, count = find_mode(numbers_example)
print(f"The mode of {numbers_example} is {mode}, and it appears {count} times.")

# 输出：The mode of [1, 2, 2, 3, 4, 4, 4] is [4], and it appears 3 times.