solve problem Sort Colors

Author: P-ppc

README.md

@@ -293,6 +293,7 @@ All solutions will be accepted!
 |74|[Search A 2d Matrix](https://leetcode-cn.com/problems/search-a-2d-matrix/description/)|[java/py/js](./algorithms/SearchA2dMatrix)|Medium|
 |153|[Find Minimum In Rotated Sorted Array](https://leetcode-cn.com/problems/find-minimum-in-rotated-sorted-array/description/)|[java/py/js](./algorithms/FindMinimumInRotatedSortedArray)|Medium|
 |34|[Find First And Last Position Of Element In Sorted Array](https://leetcode-cn.com/problems/find-first-and-last-position-of-element-in-sorted-array/description/)|[java/py/js](./algorithms/FindFirstAndLastPositionOfElementInSortedArray)|Medium|
+|75|[Sort Colors](https://leetcode-cn.com/problems/sort-colors/description/)|[java/py/js](./algorithms/SortColors)|Medium|
 
 # Database
 |#|Title|Solution|Difficulty|

algorithms/SortColors/README.md

@@ -0,0 +1,2 @@
+# Sort Colors
+We can solve this problem by double pointers

algorithms/SortColors/Solution.java

@@ -0,0 +1,20 @@
+class Solution {
+    public void sortColors(int[] nums) {
+        int start = 0,
+            end = nums.length - 1,
+            cur = 0;
+    
+        while (cur <= end) {
+            if (nums[cur] == 0 && cur != start) {
+                nums[start] = nums[start] + nums[cur];
+                nums[cur] = nums[start] - nums[cur];
+                nums[start++] -= nums[cur];
+            } else if (nums[cur] == 2 && cur != end) {
+                nums[end] = nums[end] + nums[cur];
+                nums[cur] = nums[end] - nums[cur];
+                nums[end--] -= nums[cur];
+            } else
+                cur++;
+        }
+    }
+}

algorithms/SortColors/solution.js

@@ -0,0 +1,22 @@
+/**
+ * @param {number[]} nums
+ * @return {void} Do not return anything, modify nums in-place instead.
+ */
+var sortColors = function(nums) {
+    let start = 0,
+        end = nums.length - 1,
+        cur = 0
+    
+    while (cur <= end) {
+        if (nums[cur] == 0 && cur != start) {
+            nums[start] = nums[start] + nums[cur]
+            nums[cur] = nums[start] - nums[cur]
+            nums[start++] -= nums[cur]
+        } else if (nums[cur] == 2 && cur != end) {
+            nums[end] = nums[end] + nums[cur]
+            nums[cur] = nums[end] - nums[cur]
+            nums[end--] -= nums[cur]
+        } else
+            cur++
+    }
+};

algorithms/SortColors/solution.py

@@ -0,0 +1,21 @@
+class Solution(object):
+    def sortColors(self, nums):
+        """
+        :type nums: List[int]
+        :rtype: void Do not return anything, modify nums in-place instead.
+        """
+        start = 0
+        end = len(nums) - 1
+        cur = 0
+        
+        while cur <= end:
+            if nums[cur] == 0 and cur != start:
+                nums[start], nums[cur] = nums[cur], nums[start]
+                start += 1
+            elif nums[cur] == 2 and cur != end:
+                nums[end], nums[cur] = nums[cur], nums[end]
+                end -= 1
+            else:
+                cur += 1
+        
+