Sliding Window Maximum-Partially accpeted

SlidingMaximum.java

public class SlidingMaximum {
    public ArrayList<Integer> slidingMaximum(final List<Integer> A,int B){
        int start=0;
        ArrayList<Integer> result=new ArrayList<Integer>();
        PriorityQueue<Integer> pq=new PriorityQueue<Integer>(Collections.reverseOrder());

        for(int i=0;i<A.size();i++){
          while((i-start)!=(B-1)){
              pq.add(A.get(i));
                i++;              
          } 
          pq.add(A.get(i));//add current
          result.add(pq.peek());//mark maximum in result queue
          //remove expired from heap.
          if(pq.peek()!=A.get(start)){
              pq.remove(A.get(start));
          }else{
              pq.poll();
          }
          start++;
        //  i=end;
        } 
        return result;
    }
}