在List <int>中查找最常出现的数字

List<int> numbers = [1, 2, 3, 2, 1, 3, 1, 2, 3, 3, 3];
Map<int, int> countMap = {};

// 遍历列表，记录每个数字出现的次数
for (int number in numbers) {
  if (countMap.containsKey(number)) {
    countMap[number]++;
  } else {
    countMap[number] = 1;
  }
}

// 找到出现次数最多的数字
int maxCountNumber = numbers[0];
int maxCount = countMap[numbers[0]];
for (int number in countMap.keys) {
  if (countMap[number] > maxCount) {
    maxCountNumber = number;
    maxCount = countMap[number];
  }
}

print("最常出现的数字是：$maxCountNumber，出现了$maxCount次。");