一个数组,其项是另一个数组中连续项(相邻)的差异
An array with the terms that are the differences of consecutive terms (adjacent) in another array
我目前有:
public double[] differences()
{
diffs = new doublae[sequence.length-1];
for (int = 0; i<sequence.length; ++i){
double diff = sequence[i+1] - sequence[i];
diffs[i] = diff;
}
return diffs;
}
然而,当我 运行 一个测试程序来检查它时,这不起作用。
您的范围应该不同 - i
不应超过 sequence.length - 2
以使 i+1
成为有效索引。
double[] diffs = new double[sequence.length-1];
for (int = 0; i < sequence.length - 1; i++) { // changed the condition
double diff = sequence[i+1] - sequence[i];
diffs[i] = diff;
}
我目前有:
public double[] differences()
{
diffs = new doublae[sequence.length-1];
for (int = 0; i<sequence.length; ++i){
double diff = sequence[i+1] - sequence[i];
diffs[i] = diff;
}
return diffs;
}
然而,当我 运行 一个测试程序来检查它时,这不起作用。
您的范围应该不同 - i
不应超过 sequence.length - 2
以使 i+1
成为有效索引。
double[] diffs = new double[sequence.length-1];
for (int = 0; i < sequence.length - 1; i++) { // changed the condition
double diff = sequence[i+1] - sequence[i];
diffs[i] = diff;
}