题解 | 排列颜色

#include <any>
#include <type_traits>
#include <vector>
class Solution {
public:
    void sortColors(int A[], int n) {
        int left = 0;
        int curr = 0;
        int right = n - 1;
        while(curr <= right){
            if(A[curr] == 0){
                swap(A[left], A[curr]);
                left++;
                curr++;
            }
            else if(A[curr] == 1){
                curr++;
            }
            else if(A[curr] == 2){
                swap(A[right], A[curr]);
                right--;
            }
        }
        
        
        
        
        return;
    }
};