分析： 快排partition?最左邊的那些0和最右邊的那些1都可以不管

#include <iostream>
#include <string>
#include <vector>
using namespace std;


class Solution {
public:
    int minPartition(string &A) {
       int n = A.size();
       int i = 0;
       int j = n - 1;
       int count = 0;
       while(i < j)
       {
		   //cout << 1<< endl;
			if(A[i] == '1')
			{
				if(A[j] == '0')
				{
					count++;
					i++;
					j--;
				}
				else
					j--;
			}
			else
				i++;
		}
       return count;
      
      
    }
};


int main()
{
	Solution* p = new Solution;
	string B = "000011001";
	cout << B << endl;
	cout <<p->minPartition(B)<< endl;
	delete p;
	return 0;
}