I was working on a Codility problem:
You are given two non-empty zero-indexed arrays A and B consisting of N integers. Arrays A and B represent N voracious fish in a river, ordered downstream along the flow of the river.
The fish are numbered from 0 to N − 1. If P and Q are two fish and P < Q, then fish P is initially upstream of fish Q. Initially, each fish has a unique position.
Fish number P is represented by A[P] and B[P]. Array A contains the sizes of the fish. All its elements are unique. Array B contains the directions of the fish. It contains only 0s and/or 1s, where:
0 represents a fish flowing upstream, 1 represents a fish flowing downstream. If two fish move in opposite directions and there are no other (living) fish between them, they will eventually meet each other. Then only one fish can stay alive − the larger fish eats the smaller one. More precisely, we say that two fish P and Q meet each other when P < Q, B[P] = 1 and B[Q] = 0, and there are no living fish between them. After they meet:
If A[P] > A[Q] then P eats Q, and P will still be flowing downstream, If A[Q] > A[P] then Q eats P, and Q will still be flowing upstream. We assume that all the fish are flowing at the same speed. That is, fish moving in the same direction never meet. The goal is to calculate the number of fish that will stay alive.
**Complexity:**
expected worst-case time complexity is O(N); expected worst-case space complexity is O(N), beyond input storage (not counting the storage required for input arguments).
Here is my solution: (100% correct results)
public int solution(int[] a, int[] b) {
int remFish = a.length;
int i = 0;
for (i = 0; i < b.length; i++) {
if(b[i] != 0){
/*remFish++; }else { */ break;
}
}
Stack<Integer> myQ = new Stack<Integer>();
for (int j = i; j < b.length; j++) {
if(b[j] == 1)
{
myQ.add(j);
}
while(b[j] == 0 && !myQ.isEmpty()) {
if(a[j] > a[myQ.peek()]){
myQ.pop(); remFish--;
}else{
remFish--;
break;
}
}
}
return remFish;
}
Could someone help me understand whether my solution passes the complexity requirements?
Your Idea was good. I tried to make it more understandable.
import java.util.*;
class Solution {
public int solution(int[] A, int[] B) {
int numFishes = A.length;
// no fishes
if(numFishes == 0)
return 0;
// Deque stores the fishes swimming downstreams (B[i]==1)
Deque<Integer> downstreams = new ArrayDeque<Integer>();
for(int i = 0; i < A.length; i++){
//Fish is going downstreams
if(B[i] == 1){
// push the fish into the Deque
downstreams.push(A[i]);
}//Fish is going upstreams
else{
while( !downstreams.isEmpty() ){
// Downstream-fish is bigger
if( downstreams.peek() > A[i] ){
//Upstream-fish gets eaten
numFishes--;
break;
}// Downstream-fish is smaller
else if(downstreams.peek() < A[i]){
//Downstream-fish gets eaten
numFishes--;
downstreams.pop();
}
}
}
}
return numFishes;
}
}