Hi,
Does anyone knows how one single Array elements getting stored in two different stacks? Please explain.
I have one Array elements like this {-4,3,8,-1,1,-6,4,5} , using LinkedList
we need to calculate the maximun count of positive values. In the above case it should return the value 10!! its calculatig the addition subsequent positive number plus next negative number.. hope you clear.
Please provide me the hint how to do this..
> hope you clear.
>
Anything but.
I didn't understand the following statment:
> its calculatig the addition subsequent positive number plus next negative number
So you expected 10, what answer did you actually get?
Edit: And post some code maybe, it may help. And use code tags (the code button above the reply window).
Use a loop adding each element to another variable that was initialised with 0. Write something up for that (at least try to), and if you are unable to get it right, then post the code you wrote here (using code tags) and we will give a nudge in the right direction again.
Edit: With an if statement to check the current element being added onto the variable, of course.
int data = { -4, 3, 8, -1, 1, -6, 4, 5 };
int total = 0;
for (int i : data) {
if (i > 0) {
total += i;
} else {
if (total > 0) {
total += i;
break;
}
}
}
return total;
(Edit) i don't understand this part :
> Does anyone knows how one single Array elements getting stored in
> two different stacks?
> using LinkedList
> we need to calculate the maximun count of positive
> values.
Message was edited by:
j_shadinata
You shoudn't really do it for him, but I believe that "maximum count part" is because of the 4, 5 at the end only being 9, therefore the 3, 8, -1 part is the correct return value, but everything would have to be evaluated as if it ended with 6, 5 then 11 would be the answer (I believe thats what that means).
Thanks a lot Shadinata!! Your code worked out very well!
class ArrayBound
{
public static void main(String[] args)
{
int[] data = { -4, 3, 8, -1, 1, -6, 4, 5 };
int total = 0;
for (int i=0; i<data.length; i++) {
if (data[i] > 0) {
total += data[i];
} else {
if (total > 0) {
total += data[i];
break;
}
}
}
System.out.println(total);
}
}
>(Edit) i don't understand this part :
> Does anyone knows how one single Array elements getting stored in
> two different stacks?
What i asked was I have a single empty array. i know how to to store the values in that single array, but i dont know how to push and pop the those values in two different stacks at the same time.. I know abt stack processes push to insert the value from bottom and retrieved in LIFO order.. but how the memory space utilized? are they going to share the same memory space and different stack space?
