jsonricks
diff --git a/‎.DS_Store‎
0 Bytes b/‎.DS_Store‎
0 Bytes
diff --git a/‎Java/.DS_Store‎
0 Bytes b/‎Java/.DS_Store‎
0 Bytes
diff --git a/‎Java/alg/.DS_Store‎
0 Bytes b/‎Java/alg/.DS_Store‎
0 Bytes
diff --git a/‎Java/alg/README.md‎
Lines changed: 1 addition & 0 deletions b/‎Java/alg/README.md‎
Lines changed: 1 addition & 0 deletions
diff --git a/‎Java/alg/lc/75.颜色分类.md‎
Lines changed: 98 additions & 0 deletions b/‎Java/alg/lc/75.颜色分类.md‎
Lines changed: 98 additions & 0 deletions
@@ -123,6 +123,7 @@
 - [63.不同路径2](lc/63.不同路径2.md)
 - [64.最小路径和](lc/64.最小路径和.md)
 - [74. 搜索二维矩阵](lc/74.搜索二维矩阵.md)
+- [75.颜色分类](lc/75.颜色分类.md)
 
 ## 笔试
 
 
@@ -0,0 +1,98 @@
+# 75. 颜色分类
+
+[url](https://leetcode-cn.com/problems/sort-colors/)
+
+## 题目
+
+给定一个包含红色、白色和蓝色，一共 n 个元素的数组，原地对它们进行排序，使得相同颜色的元素相邻，并按照红色、白色、蓝色顺序排列。此题中，我们使用整数 0、 1 和 2 分别表示红色、白色和蓝色。
+
+
+```
+输入：nums = [2,0,2,1,1,0]
+输出：[0,0,1,1,2,2]
+输入：nums = [2,0,1]
+输出：[0,1,2]
+输入：nums = [0]
+输出：[0]
+```
+
+
+
+
+## 方法
+
+
+
+
+## code
+
+### js
+
+```js
+let sortColors = nums => {
+ let swap = (a, i, j) => {
+ let t = a[i];
+        a[i] = a[j];
+        a[j] = t;
+    }
+ let zero = -1, one = 0, two = nums.length;
+ while (one < two) {
+ if (nums[one] === 0)
+ swap(nums, ++zero, one++);
+ else if (nums[one] === 2)
+ swap(nums, --two, one);
+ else
+ ++one;
+    }
+}
+```
+
+### go
+
+```go
+func sortColors(nums []int) {
+ swap := func(a []int, i, j int) {
+		a[i], a[j] = a[j], a[i]
+	}
+ zero, one, two := -1, 0, len(nums)
+ for one < two {
+ if nums[one] == 0 {
+			zero++
+ swap(nums, zero, one)
+			one++
+		} else if nums[one] == 2 {
+			two--
+ swap(nums, two, one)
+		} else {
+			one++
+		}
+	}
+}
+```
+
+
+
+### java
+
+```java
+class Solution {
+ public void sortColors(int[] nums) {
+ int zero = -1, one = 0, two = nums.length;
+ while (one < two) {
+ if (nums[one] == 0) {
+                swap(nums, ++zero, one++);
+            } else if (nums[one] == 2){
+                swap(nums, --two, one);
+            } else {
+ ++one;
+            }
+        }
+    }
+ private void swap(int[] a, int i, int j) {
+ int t = a[i];
+        a[i] = a[j];
+        a[j] = t;
+    }
+}
+```
+