leetcode

0 class Solution {

1 public:

2 void sortColors(vector<int> &nums) const {

3 int i = 0, j = 0, k = size(nums) - 1;

4 while (j <= k) {

5 if (nums[j] < 1)

6 swap(nums[i++], nums[j++]);

7 else if (nums[j] > 1)

8 swap(nums[j], nums[k--]);

9 else

10 j++;

11 }

12 }

13 };