Iterator遍历集合计算平均值
使用 iterator 实现元素平均的核心做法是:通过 hasnext() 判断是否还有元素,用 next() 逐个取出并累加,最后除以计数器得到平均值。具体步骤是先初始化一个空的 iterator(假设处理双精度浮点数),在循环中累加数值并递增计数,循环结束后执行除法运算。若集合为空,需单独处理以避免除以零异常。

处理空集合与类型转换细节
当集合为空时,Iterator 的 hasNext() 直接返回 false,循环体不执行,此时必须检查计数器是否为 0 以防止 ArithmeticException。对于整数集合,累加和应使用 double 类型存储,确保最终除法结果为浮点数而非截断的整数。此外,next() 方法在遍历时会抛出 ConcurrentModificationException 如果集合被修改,因此迭代过程中不应改变集合结构。

基于输入为 [1.0, 2.0, 3.0] 的具体结果验证
针对输入列表 [1.0, 2.0, 3.0],程序将依次取出三个值,累加和为 6.0,计数器为 3,最终平均值为 2.0。该过程严格遵循迭代器顺序,无跳过或重复取值。若输入包含 null 值,需在 next() 后增加判空逻辑,否则 doubleValue() 调用将引发 NullPointerException。实际运行中,返回值类型为 double,符合预期。
import java.util.ArrayList;
import java.util.Iterator;
import java.util.List;
public class AverageCalculator {
public static double calculateAverage(List<double> numbers) {
if (numbers == null || numbers.isEmpty()) {
return 0.0;
}
Iterator<double> iterator = numbers.iterator();
double sum = 0.0;
int count = 0;
while (iterator.hasNext()) {
Double value = iterator.next();
if (value != null) {
sum += value;
count++;
}
}
if (count == 0) {
return 0.0;
}
return sum / count;
}
public static void main(String[] args) {
List<double> input = new ArrayList();
input.add(1.0);
input.add(2.0);
input.add(3.0);
double result = calculateAverage(input);
System.out.println("Average: " + result);
}
}</double></double></double>
预期输出:
- 返回值:2.0
- 打印文本:Average: 2.0
- 类型:double
- 空输入处理:返回 0.0,无异常
- 含 null 输入:跳过 null,仅计算非空值
digraph G {
rankdir=LR;
node [shape=box, style=filled, fillcolor=lightblue, fontname="Arial", fontsize=16];
start [label="Start", shape=diamond, fillcolor=yellow];
checkEmpty [label="Is list empty?", shape=diamond];
returnZero [label="Return 0.0", shape=ellipse];
getIterator [label="Get Iterator", shape=process];
hasNextCheck [label="Has Next?", shape=diamond];
nextValue [label="Next Value", shape=process];
addSum [label="Add to Sum", shape=process];
incrementCount [label="Increment Count", shape=process];
divide [label="Divide Sum/Count", shape=process];
returnResult [label="Return Result", shape=ellipse];
start -> checkEmpty;
checkEmpty -> returnZero [label="Yes"];
checkEmpty -> getIterator [label="No"];
getIterator -> hasNextCheck;
hasNextCheck -> nextValue [label="Yes"];
hasNextCheck -> divide [label="No"];
nextValue -> addSum;
addSum -> incrementCount;
incrementCount -> hasNextCheck;
divide -> returnResult;
returnZero -> returnResult;
}
digraph G {
rankdir=TB;
node [shape=ellipse, style=filled, fillcolor=lightgreen, fontname="Arial", fontsize=16];
integerList [label="Integer List"];
convertToDouble [label="Convert to Double"];
sumVariable [label="Sum Variable (double)"];
countVariable [label="Count Variable (int)"];
divisionOperation [label="Division Operation"];
finalAverage [label="Final Average (double)"];
integerList -> convertToDouble;
convertToDouble -> sumVariable;
convertToDouble -> countVariable;
sumVariable -> divisionOperation;
countVariable -> divisionOperation;
divisionOperation -> finalAverage;
}
digraph G {
rankdir=LR;
node [shape=record, fillcolor=white, style=filled, fontname="Arial", fontsize=16];
t [shape=plain,label=
>]; }
Java免费学习笔记:立即使用
解锁 Java 大师之旅:从入门到精通的终极指南











