feat: add solutions to lc problems: No.1777,2679

.prettierrc

@@ -31,6 +31,7 @@
                 "solution/1500-1599/1501.Countries You Can Safely Invest In/Solution.sql",
                 "solution/1500-1599/1555.Bank Account Summary/Solution.sql",
                 "solution/1600-1699/1667.Fix Names in a Table/Solution.sql",
+                "solution/1700-1799/1777.Product's Price for Each Store/Solution.sql",
                 "solution/1900-1999/1972.First and Last Call On the Same Day/Solution.sql",
                 "solution/2600-2699/2686.Immediate Food Delivery III/Solution.sql",
                 "solution/2700-2799/2752.Customers with Maximum Number of Transactions on Consecutive Days/Solution.sql"

solution/1700-1799/1777.Product's Price for Each Store/README.md

@@ -59,7 +59,14 @@ Result 表：
 ### **SQL**
 
 ```sql
-
+# Write your MySQL query statement below
+SELECT
+    product_id,
+    sum(if(store = 'store1', price, NULL)) AS store1,
+    sum(if(store = 'store2', price, NULL)) AS store2,
+    sum(if(store = 'store3', price, NULL)) AS store3
+FROM Products
+GROUP BY 1;
 ```
 
 <!-- tabs:end -->

solution/1700-1799/1777.Product's Price for Each Store/README_EN.md

@@ -61,7 +61,14 @@ Product 1 price's are 70 for store1, 80 for store3 and, it's not sold in
 ### **SQL**
 
 ```sql
-
+# Write your MySQL query statement below
+SELECT
+    product_id,
+    sum(if(store = 'store1', price, NULL)) AS store1,
+    sum(if(store = 'store2', price, NULL)) AS store2,
+    sum(if(store = 'store3', price, NULL)) AS store3
+FROM Products
+GROUP BY 1;
 ```
 
 <!-- tabs:end -->

solution/1700-1799/1777.Product's Price for Each Store/Solution.sql

@@ -0,0 +1,8 @@
+# Write your MySQL query statement below
+SELECT
+    product_id,
+    sum(if(store = 'store1', price, NULL)) AS store1,
+    sum(if(store = 'store2', price, NULL)) AS store2,
+    sum(if(store = 'store3', price, NULL)) AS store3
+FROM Products
+GROUP BY 1;

solution/2600-2699/2679.Sum in a Matrix/README.md

@@ -65,8 +65,7 @@ class Solution:
     def matrixSum(self, nums: List[List[int]]) -> int:
         for row in nums:
             row.sort()
-        n = len(nums[0])
-        return sum(max(row[j] for row in nums) for j in range(n))
+        return sum(map(max, zip(*nums)))
 ```
 
 ### **Java**
@@ -139,6 +138,25 @@ func max(a, b int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function matrixSum(nums: number[][]): number {
+    for (const row of nums) {
+        row.sort((a, b) => a - b);
+    }
+    let ans = 0;
+    for (let j = 0; j < nums[0].length; ++j) {
+        let mx = 0;
+        for (const row of nums) {
+            mx = Math.max(mx, row[j]);
+        }
+        ans += mx;
+    }
+    return ans;
+}
+```
+
 ### **...**
 
 ```

solution/2600-2699/2679.Sum in a Matrix/README_EN.md

@@ -48,8 +48,7 @@ class Solution:
     def matrixSum(self, nums: List[List[int]]) -> int:
         for row in nums:
             row.sort()
-        n = len(nums[0])
-        return sum(max(row[j] for row in nums) for j in range(n))
+        return sum(map(max, zip(*nums)))
 ```
 
 ### **Java**
@@ -120,6 +119,25 @@ func max(a, b int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function matrixSum(nums: number[][]): number {
+    for (const row of nums) {
+        row.sort((a, b) => a - b);
+    }
+    let ans = 0;
+    for (let j = 0; j < nums[0].length; ++j) {
+        let mx = 0;
+        for (const row of nums) {
+            mx = Math.max(mx, row[j]);
+        }
+        ans += mx;
+    }
+    return ans;
+}
+```
+
 ### **...**
 
 ```

solution/2600-2699/2679.Sum in a Matrix/Solution.py

@@ -1,6 +1,5 @@
-class Solution:
-    def matrixSum(self, nums: List[List[int]]) -> int:
-        for row in nums:
-            row.sort()
-        n = len(nums[0])
-        return sum(max(row[j] for row in nums) for j in range(n))
+class Solution:
+    def matrixSum(self, nums: List[List[int]]) -> int:
+        for row in nums:
+            row.sort()
+        return sum(map(max, zip(*nums)))

solution/2600-2699/2679.Sum in a Matrix/Solution.ts

@@ -0,0 +1,14 @@
+function matrixSum(nums: number[][]): number {
+    for (const row of nums) {
+        row.sort((a, b) => a - b);
+    }
+    let ans = 0;
+    for (let j = 0; j < nums[0].length; ++j) {
+        let mx = 0;
+        for (const row of nums) {
+            mx = Math.max(mx, row[j]);
+        }
+        ans += mx;
+    }
+    return ans;
+}