feat: add solutions to lc problem: No.1029

No.1029.Two City Scheduling

Author: yanglbme

Diff for: solution/1000-1099/1029.Two City Scheduling/README.md

@@ -55,22 +55,57 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
+**方法一：贪心**
+
+选出 `aCost - bCost` 最小的 N 个人，让他们飞往 A 市，其余人飞往 B 市。
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def twoCitySchedCost(self, costs: List[List[int]]) -> int:
+        costs.sort(key=lambda x: x[0] - x[1])
+        n = len(costs) >> 1
+        return sum(costs[i][0] + costs[i + n][1] for i in range(n))
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+class Solution {
+    public int twoCitySchedCost(int[][] costs) {
+        Arrays.sort(costs, (a, b) -> {
+            return a[0] - a[1] - (b[0] - b[1]);
+        });
+        int ans = 0;
+        int n = costs.length >> 1;
+        for (int i = 0; i < n; ++i) {
+            ans += costs[i][0] + costs[i + n][1];
+        }
+        return ans;
+    }
+}
+```
 
+### **Go**
+
+```go
+func twoCitySchedCost(costs [][]int) int {
+	sort.Slice(costs, func(i, j int) bool {
+		return costs[i][0]-costs[i][1] < costs[j][0]-costs[j][1]
+	})
+	ans, n := 0, len(costs)>>1
+	for i := 0; i < n; i++ {
+		ans += costs[i][0] + costs[i+n][1]
+	}
+	return ans
+}
 ```
 
 ### **...**

Diff for: solution/1000-1099/1029.Two City Scheduling/README_EN.md

@@ -49,18 +49,51 @@ The total minimum cost is 10 + 30 + 50 + 20 = 110 to have half the people interv
 
 ## Solutions
 
+Greedy.
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 ```python
-
+class Solution:
+    def twoCitySchedCost(self, costs: List[List[int]]) -> int:
+        costs.sort(key=lambda x: x[0] - x[1])
+        n = len(costs) >> 1
+        return sum(costs[i][0] + costs[i + n][1] for i in range(n))
 ```
 
 ### **Java**
 
 ```java
+class Solution {
+    public int twoCitySchedCost(int[][] costs) {
+        Arrays.sort(costs, (a, b) -> {
+            return a[0] - a[1] - (b[0] - b[1]);
+        });
+        int ans = 0;
+        int n = costs.length >> 1;
+        for (int i = 0; i < n; ++i) {
+            ans += costs[i][0] + costs[i + n][1];
+        }
+        return ans;
+    }
+}
+```
 
+### **Go**
+
+```go
+func twoCitySchedCost(costs [][]int) int {
+	sort.Slice(costs, func(i, j int) bool {
+		return costs[i][0]-costs[i][1] < costs[j][0]-costs[j][1]
+	})
+	ans, n := 0, len(costs)>>1
+	for i := 0; i < n; i++ {
+		ans += costs[i][0] + costs[i+n][1]
+	}
+	return ans
+}
 ```
 
 ### **...**

Diff for: solution/1000-1099/1029.Two City Scheduling/Solution.go

@@ -0,0 +1,10 @@
+func twoCitySchedCost(costs [][]int) int {
+	sort.Slice(costs, func(i, j int) bool {
+		return costs[i][0]-costs[i][1] < costs[j][0]-costs[j][1]
+	})
+	ans, n := 0, len(costs)>>1
+	for i := 0; i < n; i++ {
+		ans += costs[i][0] + costs[i+n][1]
+	}
+	return ans
+}

Diff for: solution/1000-1099/1029.Two City Scheduling/Solution.java

@@ -1,17 +1,13 @@
-class Solution {
-        public int twoCitySchedCost(int[][] costs) {
-        Arrays.sort(costs, (a, b) -> {
-            return a[0] - a[1] - (b[0] - b[1]);
-        });
-
-        int sum = 0;
-        for (int i = 0; i < costs.length; ++i) {
-            if (i < costs.length / 2) {
-                sum += costs[i][0];
-            } else {
-                sum += costs[i][1];
-            }
-        }
-        return sum;
-    }
-}
+class Solution {
+    public int twoCitySchedCost(int[][] costs) {
+        Arrays.sort(costs, (a, b) -> {
+            return a[0] - a[1] - (b[0] - b[1]);
+        });
+        int ans = 0;
+        int n = costs.length >> 1;
+        for (int i = 0; i < n; ++i) {
+            ans += costs[i][0] + costs[i + n][1];
+        }
+        return ans;
+    }
+}

Diff for: solution/1000-1099/1029.Two City Scheduling/Solution.py

@@ -0,0 +1,5 @@
+class Solution:
+    def twoCitySchedCost(self, costs: List[List[int]]) -> int:
+        costs.sort(key=lambda x: x[0] - x[1])
+        n = len(costs) >> 1
+        return sum(costs[i][0] + costs[i + n][1] for i in range(n))