Domanda di colloquio di Google

Maximum contiguous sub sequence sum problem.

Risposte di colloquio

Anonimo

31 ott 2011

Detailed analysis and solution are available on the blog: http://codercareer.blogspot.com/2011/09/no-03-maximum-sum-of-all-sub-arrays.html

Anonimo

20 gen 2012

public static void maxSum(int[] arr){ int maxsofar = 0; int maxendinghere = 0; for (int i=0; i

1