SelectedList = sortrows(SelectedList,-1); [Srow, ~] = size(SelectedList); for i = 1:Srow temp = 1; pathStep = sum(SelectedList(i,:)>0) - 1; for j = 1+1:int64(pathStep+1) if j == 2 && j < pathStep+1 temp = R(ind)*A(ind,SelectedList(i,j)); elseif j == 2 && j == pathStep+1 temp = R(ind)*A(ind,SelectedList(i,j))*X(SelectedList(i,j)); elseif j<pathStep+1 temp = temp*A(SelectedList(i,j-1),SelectedList(i,j)); elseif j == pathStep+1 && j~=2 temp = temp*A(SelectedList(i,j-1),SelectedList(i,j))*X(SelectedList(i,j)); end end SelectedList(i,1) = temp; end SelectedList = sortrows(SelectedList,-1); end

根据您提供的代码，问题出现在循环中的索引计算部分。在第二个循环中，您使用了 `1+1` 作为起始索引，这导致了索引超过了数组边界。

为了解决这个问题，您可以将起始索引设为 `2`，而不是 `1+1`。这样可以确保在循环中正确访问 `SelectedList` 的元素。

以下是修改后的代码示例：

SelectedList = sortrows(SelectedList,-1);
[Srow, ~] = size(SelectedList);

for i = 1:Srow
    temp = 1;
    pathStep = sum(SelectedList(i,:)>0) - 1;
    for j = 2:pathStep+1
        if j == 2 && j < pathStep+1
            temp = R(ind)*A(ind,SelectedList(i,j));
        elseif j == 2 && j == pathStep+1
            temp = R(ind)*A(ind,SelectedList(i,j))*X(SelectedList(i,j));
        elseif j < pathStep+1
            temp = temp*A(SelectedList(i,j-1),SelectedList(i,j));
        elseif j == pathStep+1 && j~=2
            temp = temp*A(SelectedList(i,j-1),SelectedList(i,j))*X(SelectedList(i,j));
        end
    end 
    
    SelectedList(i,1) = temp;
end

SelectedList = sortrows(SelectedList,-1);

通过将起始索引设置为 `2`，您可以避免索引超出数组边界的问题，并正确计算 `SelectedList` 的元素。

希望这次的回答能够解决您的问题。如果您还有任何其他疑问，请随时提问。