Feeds
已回答
Write a function called max_sum that takes v, a row vector of numbers, and n, a positive integer as inputs. The function needs to find the n consecutive elements of v whose sum is the largest possible.
function [summa,index] = max_sum(v,n) if n>length(v) summa = 0; index = -1; return; end x=1; y=n; great = -i...
Write a function called max_sum that takes v, a row vector of numbers, and n, a positive integer as inputs. The function needs to find the n consecutive elements of v whose sum is the largest possible.
function [summa,index] = max_sum(v,n) if n>length(v) summa = 0; index = -1; return; end x=1; y=n; great = -i...
5 years 前 | 0
已回答
If else problem for year
function valid = valid_date(x,y,z) t = (isscalar(x) && isscalar(y) && isscalar(z)); if t==false valid = false; retur...
If else problem for year
function valid = valid_date(x,y,z) t = (isscalar(x) && isscalar(y) && isscalar(z)); if t==false valid = false; retur...
5 years 前 | 2
