given an unsigned char array, find if there is a subarray whose elements sum up to a given value
Respostas da entrevista
Sigiloso
24 de set. de 2013
Total wrong answer. You are not finding the subarray at all. Must use recurison for simplified version
Sigiloso
19 de mai. de 2013
bug -
J < array.length-i
otherwise you go out of the array boundaries
Sigiloso
29 de abr. de 2013
public static bool SubArraySum(int[] array, int sum)
{
int tempsum = 0;
for(int i = 0; i sum)
{
tempsum = 0;
break;
}
}
}
return false;
}
(Note: this function operates on int instead of char)