题解 | #牛的品种排序II#

   vector<int> sortCows(vector<int>& cows) {
        // write code here
        int low = 0;         
        int high = cows.size() - 1; 
        int i = 0;
        while (i <= high) {
            if (cows[i] == 0) {
                swap(cows[i], cows[low]);
                i++;
                low++;
            } else if (cows[i] == 2) {
                swap(cows[i], cows[high]);
                high--;
            } else {
                i++;
            }
        }
        return cows;
    }
};