Pergunta de entrevista da empresa Google
- maximum sum of any continuous subsequence in an array of signed integers whats the complexity. - program to compute fibonacci sequence..standard recursive and more efficent iterative one.. algorithmic complexity of both.
Resposta da entrevista
Sigiloso
23 de jul. de 2010
public class Test3 { public static void main(String[] args) { System.out.println(new Test3().max(new int[] { 2, 3, -5, 6 })); } int max(int[] array) { int result = array[0]; int sum = 0; for (int i = 0; i result) { result = sum; } else if (sum < 0) { sum = 0; } } return result; } } Complexity is O(n)
1