feat: add solutions to lc problem: No.1018

No.1018.Binary Prefix Divisible By 5

Author: yanglbme

solution/1000-1099/1018.Binary Prefix Divisible By 5/README.md

@@ -47,22 +47,75 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
+**方法一：模拟**
+
+遍历数组，每一次遍历都将当前数字加到前面的数字上，然后对 $5$ 取模，如果结果为 $0$，则当前数字可以被 $5$ 整除，答案设置为 `true`，否则为 `false`。
+
+时间复杂度 $O(n)$，空间复杂度 $O(1)$。其中 $n$ 为数组长度。
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def prefixesDivBy5(self, nums: List[int]) -> List[bool]:
+        ans = []
+        x = 0
+        for v in nums:
+            x = (x << 1 | v) % 5
+            ans.append(x == 0)
+        return ans
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+class Solution {
+    public List<Boolean> prefixesDivBy5(int[] nums) {
+        List<Boolean> ans = new ArrayList<>();
+        int x = 0;
+        for (int v : nums) {
+            x = (x << 1 | v) % 5;
+            ans.add(x == 0);
+        }
+        return ans;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    vector<bool> prefixesDivBy5(vector<int>& nums) {
+        vector<bool> ans;
+        int x = 0;
+        for (int v : nums) {
+            x = (x << 1 | v) % 5;
+            ans.push_back(x == 0);
+        }
+        return ans;
+    }
+};
+```
 
+### **Go**
+
+```go
+func prefixesDivBy5(nums []int) (ans []bool) {
+	x := 0
+	for _, v := range nums {
+		x = (x<<1 | v) % 5
+		ans = append(ans, x == 0)
+	}
+	return
+}
 ```
 
 ### **...**

solution/1000-1099/1018.Binary Prefix Divisible By 5/README_EN.md

@@ -46,13 +46,60 @@ Only the first number is divisible by 5, so answer[0] is true.
 ### **Python3**
 
 ```python
-
+class Solution:
+    def prefixesDivBy5(self, nums: List[int]) -> List[bool]:
+        ans = []
+        x = 0
+        for v in nums:
+            x = (x << 1 | v) % 5
+            ans.append(x == 0)
+        return ans
 ```
 
 ### **Java**
 
 ```java
+class Solution {
+    public List<Boolean> prefixesDivBy5(int[] nums) {
+        List<Boolean> ans = new ArrayList<>();
+        int x = 0;
+        for (int v : nums) {
+            x = (x << 1 | v) % 5;
+            ans.add(x == 0);
+        }
+        return ans;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    vector<bool> prefixesDivBy5(vector<int>& nums) {
+        vector<bool> ans;
+        int x = 0;
+        for (int v : nums) {
+            x = (x << 1 | v) % 5;
+            ans.push_back(x == 0);
+        }
+        return ans;
+    }
+};
+```
 
+### **Go**
+
+```go
+func prefixesDivBy5(nums []int) (ans []bool) {
+	x := 0
+	for _, v := range nums {
+		x = (x<<1 | v) % 5
+		ans = append(ans, x == 0)
+	}
+	return
+}
 ```
 
 ### **...**

solution/1000-1099/1018.Binary Prefix Divisible By 5/Solution.cpp

@@ -0,0 +1,12 @@
+class Solution {
+public:
+    vector<bool> prefixesDivBy5(vector<int>& nums) {
+        vector<bool> ans;
+        int x = 0;
+        for (int v : nums) {
+            x = (x << 1 | v) % 5;
+            ans.push_back(x == 0);
+        }
+        return ans;
+    }
+};

solution/1000-1099/1018.Binary Prefix Divisible By 5/Solution.go

@@ -0,0 +1,8 @@
+func prefixesDivBy5(nums []int) (ans []bool) {
+	x := 0
+	for _, v := range nums {
+		x = (x<<1 | v) % 5
+		ans = append(ans, x == 0)
+	}
+	return
+}

solution/1000-1099/1018.Binary Prefix Divisible By 5/Solution.java

@@ -0,0 +1,11 @@
+class Solution {
+    public List<Boolean> prefixesDivBy5(int[] nums) {
+        List<Boolean> ans = new ArrayList<>();
+        int x = 0;
+        for (int v : nums) {
+            x = (x << 1 | v) % 5;
+            ans.add(x == 0);
+        }
+        return ans;
+    }
+}

solution/1000-1099/1018.Binary Prefix Divisible By 5/Solution.py

@@ -0,0 +1,8 @@
+class Solution:
+    def prefixesDivBy5(self, nums: List[int]) -> List[bool]:
+        ans = []
+        x = 0
+        for v in nums:
+            x = (x << 1 | v) % 5
+            ans.append(x == 0)
+        return ans

solution/CONTEST_README.md

@@ -24,6 +24,14 @@
 
 ## 往期竞赛
 
+#### 第 332 场周赛(2023-02-12 10:30, 90 分钟) 参赛人数 4547
+
+- [2562. 找出数组的串联值](/solution/2500-2599/2562.Find%20the%20Array%20Concatenation%20Value/README.md)
+- [2563. 统计公平数对的数目](/solution/2500-2599/2563.Count%20the%20Number%20of%20Fair%20Pairs/README.md)
+- [2564. 子字符串异或查询](/solution/2500-2599/2564.Substring%20XOR%20Queries/README.md)
+- [2565. 最少得分子序列](/solution/2500-2599/2565.Subsequence%20With%20the%20Minimum%20Score/README.md)
+
+
 #### 第 331 场周赛(2023-02-05 10:30, 90 分钟) 参赛人数 4256
 
 - [2558. 从数量最多的堆取走礼物](/solution/2500-2599/2558.Take%20Gifts%20From%20the%20Richest%20Pile/README.md)
@@ -2584,7 +2592,7 @@
 - [936. 戳印序列](/solution/0900-0999/0936.Stamping%20The%20Sequence/README.md)
 
 
-#### 第 108 场周赛(2018-10-28 09:30, 90 分钟) 参赛人数 523
+#### 第 108 场周赛(2018-10-28 09:30, 90 分钟) 参赛人数 524
 
 - [929. 独特的电子邮件地址](/solution/0900-0999/0929.Unique%20Email%20Addresses/README.md)
 - [930. 和相同的二元子数组](/solution/0900-0999/0930.Binary%20Subarrays%20With%20Sum/README.md)

solution/CONTEST_README_EN.md

@@ -25,6 +25,14 @@ Get your rating changes right after the completion of LeetCode contests, https:/
 
 ## Past Contests
 
+#### Weekly Contest 332
+
+- [2562. Find the Array Concatenation Value](/solution/2500-2599/2562.Find%20the%20Array%20Concatenation%20Value/README_EN.md)
+- [2563. Count the Number of Fair Pairs](/solution/2500-2599/2563.Count%20the%20Number%20of%20Fair%20Pairs/README_EN.md)
+- [2564. Substring XOR Queries](/solution/2500-2599/2564.Substring%20XOR%20Queries/README_EN.md)
+- [2565. Subsequence With the Minimum Score](/solution/2500-2599/2565.Subsequence%20With%20the%20Minimum%20Score/README_EN.md)
+
+
 #### Weekly Contest 331
 
 - [2558. Take Gifts From the Richest Pile](/solution/2500-2599/2558.Take%20Gifts%20From%20the%20Richest%20Pile/README_EN.md)