75 Sort Colors

Given an array with n objects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the order red, white and blue.
Here, we will use the integers 0, 1, and 2 to represent the color red, white, and blue respectively.
Note: You are not suppose to use the library's sort function for this problem.
The Idea: Hash count the numbers, then iterate through the counts to replace the elements in the array. The counts are guareenteed to be within 0-2, so we have constant space.
Complexity: O(n) time and constant space
def sortColors(self, nums):
:type nums: List[int]
:rtype: void Do not return anything, modify nums in-place instead.
counts = collections.Counter(nums)
iter = 0
for i in range(0, 4):
if i in counts:
for j in range(0, counts[i]):
nums[iter] = i
iter += 1