Added Sort Colors

Author: gahogg

Sort Colors - Leetcode 75/Sort Colors - Leetcode 75.cpp

@@ -0,0 +1,24 @@
+#include <vector>
+
+class Solution {
+public:
+    void sortColors(std::vector<int>& nums) {
+        int counts[3] = {0, 0, 0};
+
+        for (int color : nums) {
+            counts[color]++;
+        }
+
+        int R = counts[0], W = counts[1], B = counts[2];
+
+        for (int i = 0; i < R; i++) {
+            nums[i] = 0;
+        }
+        for (int i = R; i < R + W; i++) {
+            nums[i] = 1;
+        }
+        for (int i = R + W; i < nums.size(); i++) {
+            nums[i] = 2;
+        }
+    }
+};

Sort Colors - Leetcode 75/Sort Colors - Leetcode 75.java

@@ -0,0 +1,21 @@
+public class Solution {
+    public void sortColors(int[] nums) {
+        int[] counts = new int[3];
+
+        for (int color : nums) {
+            counts[color]++;
+        }
+
+        int R = counts[0], W = counts[1], B = counts[2];
+
+        for (int i = 0; i < R; i++) {
+            nums[i] = 0;
+        }
+        for (int i = R; i < R + W; i++) {
+            nums[i] = 1;
+        }
+        for (int i = R + W; i < nums.length; i++) {
+            nums[i] = 2;
+        }
+    }
+}

Sort Colors - Leetcode 75/Sort Colors - Leetcode 75.js

@@ -0,0 +1,13 @@
+var sortColors = function(nums) {
+    let counts = [0, 0, 0];
+
+    for (let color of nums) {
+        counts[color]++;
+    }
+
+    let R = counts[0], W = counts[1], B = counts[2];
+
+    nums.fill(0, 0, R);
+    nums.fill(1, R, R + W);
+    nums.fill(2, R + W, R + W + B);
+};

Sort Colors - Leetcode 75/Sort Colors - Leetcode 75.py

@@ -0,0 +1,15 @@
+class Solution:
+    def sortColors(self, nums: List[int]) -> None:
+        """
+        Do not return anything, modify nums in-place instead.
+        """
+        counts = [0, 0, 0]
+
+        for color in nums:
+            counts[color] += 1
+        
+        R, W, B = counts
+        
+        nums[:R]    = [0] * R
+        nums[R:R+W] = [1] * W 
+        nums[R+W:]  = [2] * B