Leetcode-915 Partition Array into Disjoint Intervals(分割数组)

class Solution
{
    public:
        int partitionDisjoint(vector<int>& A)
        {
            if(A.size()==2&&A[0]<=A[1])
                return 1;
            vector<int> B(A.size(),0);
            
            int Min = 10000000;
            for(int i = A.size()-1;i >= 0;i --)
            {
                if(A[i]<Min)
                {
                    B[i] = A[i];
                    Min = A[i];
                }
                else
                    B[i] = Min;
            }
            
        //    for(auto d:B)
        //        cout << d << " ";
        //        cout << endl;
            int result = 0;
            int Max = A[0];
            for(int i = 0;i < A.size();i ++)
            {
                if(Max <= B[i])
                {
                    result = i;
                    break;
                }
                if(A[i]>Max)
                {
                    Max = A[i];
                }
            }
            if(result==0)
                result = 1;
            return result;
        }
};