Question entretien chez Google : Maximum contiguous sub sequence sum problem.

Google

Maximum contiguous sub sequence sum problem.

Utilisateur anonyme

31 oct. 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

Utilisateur anonyme

20 janv. 2012

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