feat: add solutions to lc problem: No.2185

No.2185.Counting Words With a Given Prefix

Author: yanglbme

solution/0000-0099/0033.Search in Rotated Sorted Array/README.md

@@ -83,12 +83,12 @@ class Solution:
         while left < right:
             mid = (left + right) >> 1
             if nums[0] <= nums[mid]:
-                if nums[0] <= target and target <= nums[mid]:
+                if nums[0] <= target <= nums[mid]:
                     right = mid
                 else:
                     left = mid + 1
             else:
-                if nums[mid] < target and target <= nums[n - 1]:
+                if nums[mid] < target <= nums[n - 1]:
                     left = mid + 1
                 else:
                     right = mid

solution/0000-0099/0033.Search in Rotated Sorted Array/README_EN.md

@@ -50,12 +50,12 @@ class Solution:
         while left < right:
             mid = (left + right) >> 1
             if nums[0] <= nums[mid]:
-                if nums[0] <= target and target <= nums[mid]:
+                if nums[0] <= target <= nums[mid]:
                     right = mid
                 else:
                     left = mid + 1
             else:
-                if nums[mid] < target and target <= nums[n - 1]:
+                if nums[mid] < target <= nums[n - 1]:
                     left = mid + 1
                 else:
                     right = mid

solution/0000-0099/0033.Search in Rotated Sorted Array/Solution.py

@@ -5,12 +5,12 @@ def search(self, nums: List[int], target: int) -> int:
         while left < right:
             mid = (left + right) >> 1
             if nums[0] <= nums[mid]:
-                if nums[0] <= target and target <= nums[mid]:
+                if nums[0] <= target <= nums[mid]:
                     right = mid
                 else:
                     left = mid + 1
             else:
-                if nums[mid] < target and target <= nums[n - 1]:
+                if nums[mid] < target <= nums[n - 1]:
                     left = mid + 1
                 else:
                     right = mid

solution/2100-2199/2185.Counting Words With a Given Prefix/README.md

@@ -49,15 +49,27 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def prefixCount(self, words: List[str], pref: str) -> int:
+        return sum(w.startswith(pref) for w in words)
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public int prefixCount(String[] words, String pref) {
+        int ans = 0;
+        for (String w : words) {
+            if (w.startsWith(pref)) {
+                ++ans;
+            }
+        }
+        return ans;
+    }
+}
 ```
 
 ### **TypeScript**
@@ -75,6 +87,35 @@ function prefixCount(words: string[], pref: string): number {
 }
 ```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int prefixCount(vector<string>& words, string pref) {
+        int ans = 0;
+        for (auto& w : words)
+            if (w.find(pref) == 0)
+                ++ans;
+        return ans;
+    }
+};
+```
+
+### **Go**
+
+```go
+func prefixCount(words []string, pref string) int {
+	ans := 0
+	for _, w := range words {
+		if strings.HasPrefix(w, pref) {
+			ans++
+		}
+	}
+	return ans
+}
+```
+
 ### **...**
 
 ```

solution/2100-2199/2185.Counting Words With a Given Prefix/README_EN.md

@@ -43,13 +43,25 @@
 ### **Python3**
 
 ```python
-
+class Solution:
+    def prefixCount(self, words: List[str], pref: str) -> int:
+        return sum(w.startswith(pref) for w in words)
 ```
 
 ### **Java**
 
 ```java
-
+class Solution {
+    public int prefixCount(String[] words, String pref) {
+        int ans = 0;
+        for (String w : words) {
+            if (w.startsWith(pref)) {
+                ++ans;
+            }
+        }
+        return ans;
+    }
+}
 ```
 
 ### **TypeScript**
@@ -67,6 +79,35 @@ function prefixCount(words: string[], pref: string): number {
 }
 ```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int prefixCount(vector<string>& words, string pref) {
+        int ans = 0;
+        for (auto& w : words)
+            if (w.find(pref) == 0)
+                ++ans;
+        return ans;
+    }
+};
+```
+
+### **Go**
+
+```go
+func prefixCount(words []string, pref string) int {
+	ans := 0
+	for _, w := range words {
+		if strings.HasPrefix(w, pref) {
+			ans++
+		}
+	}
+	return ans
+}
+```
+
 ### **...**
 
 ```

solution/2100-2199/2185.Counting Words With a Given Prefix/Solution.cpp

@@ -0,0 +1,10 @@
+class Solution {
+public:
+    int prefixCount(vector<string>& words, string pref) {
+        int ans = 0;
+        for (auto& w : words)
+            if (w.find(pref) == 0)
+                ++ans;
+        return ans;
+    }
+};

solution/2100-2199/2185.Counting Words With a Given Prefix/Solution.go

@@ -0,0 +1,9 @@
+func prefixCount(words []string, pref string) int {
+	ans := 0
+	for _, w := range words {
+		if strings.HasPrefix(w, pref) {
+			ans++
+		}
+	}
+	return ans
+}

solution/2100-2199/2185.Counting Words With a Given Prefix/Solution.java

@@ -0,0 +1,11 @@
+class Solution {
+    public int prefixCount(String[] words, String pref) {
+        int ans = 0;
+        for (String w : words) {
+            if (w.startsWith(pref)) {
+                ++ans;
+            }
+        }
+        return ans;
+    }
+}

solution/2100-2199/2185.Counting Words With a Given Prefix/Solution.py

@@ -0,0 +1,3 @@
+class Solution:
+    def prefixCount(self, words: List[str], pref: str) -> int:
+        return sum(w.startswith(pref) for w in words)