function foundsecondaddress(const avalues array of double): integer; var I,J: integer; N : integer; begin I := 0; J := 0; for N := 0 to avalueslength -1 do begin if Avalues[N] > Avalues[I] then begin if Avalues[N] > Avalues[J] then begin J := N; I := J; end else begin I := N; end; end; end; result := I; end;大概就这样的吧;我没去测试;楼主自己试试看;
var I,J: integer;
N : integer;
begin
I := 0;
J := 0;
for N := 0 to avalueslength -1 do
begin
if Avalues[N] > Avalues[I] then
begin
if Avalues[N] > Avalues[J] then
begin
J := N;
I := J;
end
else begin
I := N;
end;
end;
end;
result := I;
end;大概就这样的吧;我没去测试;楼主自己试试看;