我想要达到的结果
function f=tanguo(a)
[row,col]=size(a);
if row == 1&& col == 1
f=a(1,1);
elseif row == 1
for j=1:col
f=sum(a(1,1:j));
end
elseif col == 1
for i =1:row
f=sum(a(1:i,1));
end
else
ff=ones(row,col);
ff(1,1)=a(1,1);
for j=1:col %计算第一行数据
ff(1,j)=sum(a(1,1:j));
end
for i =1:row %计算第一列数据
ff(i,1)=sum(a(1:i,1));
end
for i=2:row
for j=2:col
ff(i,j)=max(ff(i,j-1),ff(i-1,j))+a(i,j);
end
end
end
ff
%寻找最佳路径
% num=[];
% num1=find(max(ff)
end
