slippingjimmynetflix
BAN USERpublic static int maxProductSubset(int[] array) {
int retVal = 1;
int count=0;
int max = Integer.MIN_VALUE;
boolean allPositiveAreZero = true;
for(int i : array) {
if(i!=0)
retVal *= i;
if(i<0) {
count++;
max = (i>max) ? i : max;
}
if(i>0) {
allPositiveAreZero = false;
}
}
if(count%2==0) {
return retVal;
}
if(count==1 && allPositiveAreZero) {
return 0;
}
return retVal / max;
}
- slippingjimmynetflix November 23, 2016
Repstacimdalton, Dev Lead at ASAPInfosystemsPvtLtd
At the moment I'm implementing Slinkies in the financial sector. My current pet project is researching break up a ...
- slippingjimmynetflix November 29, 2016