How to find the largest product?

Question

Abedeera Jayasuriya Seena Ptabedige Nileema 2017-11-21

0
链接

此问题的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/368304-how-to-find-the-largest-product

编辑： Jan 2018-7-30

Hi, I am trying to solve this homework. could anyone please help me to solve this?

* Write a function max_product that takes v a vector and n, a positive integer, as inputs and computes the largest product of n consecutive elements of v. It returns the product and the index of the element of v that is the first term of the product. If there are multiple such products in v, the function must return the one with the smallest starting index. As an example, the following call >> [product, ind] = max_product([1 2 2 1 3 1],3); will assign 6 to product and 3 to ind since the max 3-term product in the input vector is 2*1*3. If v has fewer than n elements, the function returns 0 and -1, respectively.

5 个评论
显示 3更早的评论隐藏 3更早的评论

Stephen23 2017-11-21

@Andrei Bobrov: please show examples of using movsum and conv.

Andrei Bobrov 2017-11-21

Hi Stephen! See my answer.

请先登录，再进行评论。

请先登录，再回答此问题。

Answer 1

Stephen23 2017-11-21

0
链接

此回答的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/368304-how-to-find-the-largest-product#answer_292312

编辑：Stephen23 2017-11-21

在 MATLAB Online 中打开

function [product,ind] = max_product(a,n)
product = 0;
ind = -1;
num = numel(a);
for k = 1:1+num-n
  tmp = prod(a(k:k+n-1));
  if tmp>product
    product = tmp;
    ind = k;
  end
end
end

And tested:

>> [product, ind] = max_product([1 2 2 1 3 1],3)
product =  6
ind =  3
>> [product, ind] = max_product([1 2 2 1 3 9],3)
product =  27
ind =  4
>> [product, ind] = max_product([1 2 2 1 3 9],9)
product = 0
ind = -1

This could be vectorized, or you could use movprod, but using a loop makes the algorithm clear.

0 个评论
显示 -2更早的评论隐藏 -2更早的评论

请先登录，再进行评论。

Answer 2

Jan 2017-11-21

0
链接

此回答的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/368304-how-to-find-the-largest-product#answer_292315

编辑：Jan 2017-11-21

在 MATLAB Online 中打开

And a vectorized version:

function [P, Ind] = max_product(v, n)
X        = v((1:numel(v) - n + 1) + (0:n-1).');
[P, Ind] = max(prod(X, 1));
end

6 个评论
显示 4更早的评论隐藏 4更早的评论

silvia a 2018-7-30

编辑：silvia a 2018-7-30

thank you very much for your answer; I have solved it;

I do not know if you guys read these reviews. But I wanted to tell you that your answers and code examples help very much. I am very new to this but trying out your examples really helped me to get started and have a better grasp of things. Thank you!

Jan 2018-7-30

编辑：Jan 2018-7-30

Dear silvia a, the "guys and girls" here read the comments usually. I'm happy, that I could help you, because this my reason to post answers. You are welcome. I appreciate your feedback, thanks.

请先登录，再进行评论。

Answer 3

Andrei Bobrov 2017-11-21

0
链接

此回答的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/368304-how-to-find-the-largest-product#answer_292319

编辑：Andrei Bobrov 2017-11-21

在 MATLAB Online 中打开

Op! Everyone solves someone else's homework ... I also want! :)

[product1, ind] = max(prod(hankel(a(1:end-b+1),a(end-b+1:end)),2))

as function:

function [product1,ind]=max_product(a,b)
    try
        [product1, ind] = max(prod(hankel(a(1:end-b+1),a(end-b+1:end)),2));
    catch
        product1 = 0;
        ind = -1;
    end
end

with conv2:

function [product1,ind]=max_product(a,b)
    try
        [product1, ind] = max(exp(conv2(log(a(:)),ones(b,1),'valid')));
    catch
        product1 = 0;
        ind = -1;
    end
end