MICHAEL
Nalanda College of Engineering
Followers: 0 Following: 0
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 [s,i] = max_sum(v,n) s = 0; i = 0; len = length(v); l = len-n+1; if n>len s = 0; i = -1; else for ...
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 [s,i] = max_sum(v,n) s = 0; i = 0; len = length(v); l = len-n+1; if n>len s = 0; i = -1; else for ...
5 years 前 | 0
