feat: add solutions to lc problem: No.1337

No.1337.The K Weakest Rows in a Matrix

Author: yanglbme

solution/1300-1399/1337.The K Weakest Rows in a Matrix/README.md

@@ -84,18 +84,9 @@ k = 2
 class Solution:
     def kWeakestRows(self, mat: List[List[int]], k: int) -> List[int]:
         m, n = len(mat), len(mat[0])
-        res = []
-        for row in mat:
-            left, right = 0, n
-            while left < right:
-                mid = (left + right) >> 1
-                if row[mid] == 0:
-                    right = mid
-                else:
-                    left = mid + 1
-            res.append(left)
+        ans = [n - bisect_right(row[::-1], 0) for row in mat]
         idx = list(range(m))
-        idx.sort(key=lambda x: res[x])
+        idx.sort(key=lambda i: ans[i])
         return idx[:k]
 ```
 
@@ -194,4 +185,37 @@ public:
 };
 ```
 
+### **Go**
+
+```go
+func kWeakestRows(mat [][]int, k int) []int {
+	m, n := len(mat), len(mat[0])
+	res := make([]int, m)
+	var idx []int
+	for i, row := range mat {
+		idx = append(idx, i)
+		left, right := 0, n
+		for left < right {
+			mid := (left + right) >> 1
+			if row[mid] == 0 {
+				right = mid
+			} else {
+				left = mid + 1
+			}
+		}
+		res[i] = left
+	}
+	sort.Slice(idx, func(i, j int) bool {
+		return res[idx[i]] < res[idx[j]] || (res[idx[i]] == res[idx[j]] && idx[i] < idx[j])
+	})
+	return idx[:k]
+}
+```
+
+### **...**
+
+```
+
+```
+
 <!-- tabs:end -->

solution/1300-1399/1337.The K Weakest Rows in a Matrix/README_EN.md

@@ -79,18 +79,9 @@ Binary search & sort.
 class Solution:
     def kWeakestRows(self, mat: List[List[int]], k: int) -> List[int]:
         m, n = len(mat), len(mat[0])
-        res = []
-        for row in mat:
-            left, right = 0, n
-            while left < right:
-                mid = (left + right) >> 1
-                if row[mid] == 0:
-                    right = mid
-                else:
-                    left = mid + 1
-            res.append(left)
+        ans = [n - bisect_right(row[::-1], 0) for row in mat]
         idx = list(range(m))
-        idx.sort(key=lambda x: res[x])
+        idx.sort(key=lambda i: ans[i])
         return idx[:k]
 ```
 
@@ -187,4 +178,38 @@ public:
 };
 ```
 
+### **Go**
+
+```go
+func kWeakestRows(mat [][]int, k int) []int {
+	m, n := len(mat), len(mat[0])
+	res := make([]int, m)
+	var idx []int
+	for i, row := range mat {
+		idx = append(idx, i)
+		left, right := 0, n
+		for left < right {
+			mid := (left + right) >> 1
+			if row[mid] == 0 {
+				right = mid
+			} else {
+				left = mid + 1
+			}
+		}
+		res[i] = left
+	}
+	sort.Slice(idx, func(i, j int) bool {
+		return res[idx[i]] < res[idx[j]] || (res[idx[i]] == res[idx[j]] && idx[i] < idx[j])
+	})
+	return idx[:k]
+}
+```
+
+### **...**
+
+```
+
+```
+
+
 <!-- tabs:end -->

solution/1300-1399/1337.The K Weakest Rows in a Matrix/Solution.go

@@ -0,0 +1,22 @@
+func kWeakestRows(mat [][]int, k int) []int {
+	m, n := len(mat), len(mat[0])
+	res := make([]int, m)
+	var idx []int
+	for i, row := range mat {
+		idx = append(idx, i)
+		left, right := 0, n
+		for left < right {
+			mid := (left + right) >> 1
+			if row[mid] == 0 {
+				right = mid
+			} else {
+				left = mid + 1
+			}
+		}
+		res[i] = left
+	}
+	sort.Slice(idx, func(i, j int) bool {
+		return res[idx[i]] < res[idx[j]] || (res[idx[i]] == res[idx[j]] && idx[i] < idx[j])
+	})
+	return idx[:k]
+}

solution/1300-1399/1337.The K Weakest Rows in a Matrix/Solution.py

@@ -1,16 +1,7 @@
-class Solution:
-    def kWeakestRows(self, mat: List[List[int]], k: int) -> List[int]:
-        m, n = len(mat), len(mat[0])
-        res = []
-        for row in mat:
-            left, right = 0, n
-            while left < right:
-                mid = (left + right) >> 1
-                if row[mid] == 0:
-                    right = mid
-                else:
-                    left = mid + 1
-            res.append(left)
-        idx = list(range(m))
-        idx.sort(key=lambda x: res[x])
-        return idx[:k]
+class Solution:
+    def kWeakestRows(self, mat: List[List[int]], k: int) -> List[int]:
+        m, n = len(mat), len(mat[0])
+        ans = [n - bisect_right(row[::-1], 0) for row in mat]
+        idx = list(range(m))
+        idx.sort(key=lambda i: ans[i])
+        return idx[:k]