915. 分割数组

915. 分割数组

class Solution {
public:
	int partitionDisjoint(vector<int>& A) {
		int left = 0;
		while (left < A.size())
		{
			auto pos_min = min_element(A.begin() + left + 1, A.end());
			auto pos_max = max_element(A.begin(), A.begin() + left);
			if (pos_min == A.end() || pos_max == A.end())
				break;
			if (*pos_max > *pos_min)
				left = distance(A.begin(), pos_min);
			else
				break;
		}
		if (left < A.size() - 1)
			return left + 1;
		else
			return left;
	}
};