public void sortColors(int[] A) {
		int n = A.length;
		int i = 0, j = 0, k = 0;
		for (int m = 0; m < n; m++) {

			if (A[m] == 0)
				i++;
			if (A[m] == 1)
				j++;
			if (A[m] == 2)
				k++;
		}
		int m = 0;
		while (m < n) {
			if (i > 0) {
				A[m] = 0;
				i--;
			} else if (j > 0) {
				A[m] = 1;
				j--;
			} else if (k > 0) {
				A[m] = 2;
				k--;
			}
			m++;
		}
	}