Jump Game II

class Solution {
public:
    int jump(int A[], int n) 
    {
        if(n==1) return 0;
        bool* path=new bool[n];
        for(int i=1;i<n;i++) path[i]=false;
        
        vector<int>* p1=new vector<int>();
        vector<int>* p2=new vector<int>();
        path[0]=0;
        p1->push_back(0);
        int step=0;
        
        while(p1->size()>0)
        {
            sort(p1->begin(),p1->end(),greater<int>());
            step++;
            p2->clear();
            for(int i=0;i<p1->size();i++)
                for(int j=1;j<=A[(*p1)[i]];j++)
                    if(path[(*p1)[i]+j]==false)
                    {
                        int newindex=(*p1)[i]+j;
                        path[newindex]=true;
                        p2->push_back(newindex);
                        if(newindex==n-1) return step;
                    }
          vector<int>* tmp;
          tmp=p1;
          p1=p2;
          p2=tmp;
        }
        return false;
    }
};