feat: add solutions to lc problem: No.0338

No.0338.Counting Bits

Author: yanglbme

README.md

@@ -1,5 +1,5 @@
 <p align="center">
-  <a href="https://github.com/doocs/leetcode"><img src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/images/leetcode-doocs.png" alt="LeetCode-GitHub-Doocs"></a>
+  <a href="https://github.com/doocs/leetcode"><img src="https://cdn-doocs.oss-cn-shenzhen.aliyuncs.com/gh/doocs/leetcode@main/images/leetcode-doocs.png" alt="LeetCode-GitHub-Doocs"></a>
 </p>
 
 <p align="center">
@@ -166,7 +166,7 @@
 1. 你也可以参考帮助文档 https://help.github.com/cn 了解更多细节。
 
 <p align="center">
-  <a href="https://github.com/doocs/leetcode"><img src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/images/how-to-contribute.svg" alt="how-to-contribute"></a>
+  <a href="https://github.com/doocs/leetcode"><img src="https://cdn-doocs.oss-cn-shenzhen.aliyuncs.com/gh/doocs/leetcode@main/images/how-to-contribute.svg" alt="how-to-contribute"></a>
 </p>
 
 [Gitpod.io](https://www.gitpod.io) 是一个免费的在线开发环境，你也可以使用它参与本项目。
@@ -200,7 +200,7 @@
 
 知名互联网科技博主 [@爱可可-爱生活](https://weibo.com/fly51fly) 微博推荐。
 
-<a href="https://weibo.com/fly51fly" target="_blank"><img src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/images/recommender-fly51fly.png"></a>
+<a href="https://weibo.com/fly51fly" target="_blank"><img src="https://cdn-doocs.oss-cn-shenzhen.aliyuncs.com/gh/doocs/leetcode@main/images/recommender-fly51fly.png"></a>
 
 ## 许可证
 

README_EN.md

@@ -1,5 +1,5 @@
 <p align="center">
-  <a href="https://github.com/doocs/leetcode"><img src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/images/leetcode-doocs.png" alt="LeetCode-GitHub-Doocs"></a>
+  <a href="https://github.com/doocs/leetcode"><img src="https://cdn-doocs.oss-cn-shenzhen.aliyuncs.com/gh/doocs/leetcode@main/images/leetcode-doocs.png" alt="LeetCode-GitHub-Doocs"></a>
 </p>
 
 <p align="center">
@@ -160,7 +160,7 @@ I'm looking for long-term contributors/partners to this repo! Send me [PRs](http
 1. See [CONTRIBUTING](https://github.com/doocs/.github/blob/main/CONTRIBUTING.md) or [GitHub Help](https://help.github.com/en) for more details.
 
 <p align="center">
-  <a href="https://github.com/doocs/leetcode"><img src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/images/how-to-contribute.svg" alt="how-to-contribute"></a>
+  <a href="https://github.com/doocs/leetcode"><img src="https://cdn-doocs.oss-cn-shenzhen.aliyuncs.com/gh/doocs/leetcode@main/images/how-to-contribute.svg" alt="how-to-contribute"></a>
 </p>
 
 You can also contribute to [doocs/leetcode](https://github.com/doocs/leetcode) using [Gitpod.io](https://www.gitpod.io), a free online dev environment with a single click.
@@ -171,7 +171,7 @@ You can also contribute to [doocs/leetcode](https://github.com/doocs/leetcode) u
 
 <a href="https://github.com/doocs/leetcode/stargazers" target="_blank"><img src="https://starchart.cc/doocs/leetcode.svg" alt="Stargazers over time" /></a>
 
-<!-- <a href="https://github.com/doocs/leetcode/stargazers" target="_blank"><img src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/images/starcharts.svg" alt="Stargazers over time" /></a> -->
+<!-- <a href="https://github.com/doocs/leetcode/stargazers" target="_blank"><img src="https://cdn-doocs.oss-cn-shenzhen.aliyuncs.com/gh/doocs/leetcode@main/images/starcharts.svg" alt="Stargazers over time" /></a> -->
 
 ## Contributors
 

solution/0300-0399/0338.Counting Bits/README.md

@@ -60,22 +60,37 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
+**方法一：位运算**
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def countBits(self, n: int) -> List[int]:
+        ans = [0] * (n + 1)
+        for i in range(1, n + 1):
+            ans[i] = ans[i & (i - 1)] + 1
+        return ans
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public int[] countBits(int n) {
+        int[] ans = new int[n + 1];
+        for (int i = 1; i <= n; ++i) {
+            ans[i] = ans[i & (i - 1)] + 1;
+        }
+        return ans;
+    }
+}
 ```
 
 ### **C++**
@@ -84,16 +99,25 @@
 class Solution {
 public:
     vector<int> countBits(int n) {
-        vector<int> res(n + 1);
-        for (int i = 1; i <= n; i++) {
-            res[i] = res[i & (i - 1)] + 1;
-        }
-
-        return res;
+        vector<int> ans(n + 1);
+        for (int i = 1; i <= n; ++i) ans[i] = ans[i & (i - 1)] + 1;
+        return ans;
     }
 };
 ```
 
+### **Go**
+
+```go
+func countBits(n int) []int {
+	ans := make([]int, n+1)
+	for i := 1; i <= n; i++ {
+		ans[i] = ans[i&(i-1)] + 1
+	}
+	return ans
+}
+```
+
 ### **...**
 
 ```

solution/0300-0399/0338.Counting Bits/README_EN.md

@@ -54,13 +54,26 @@
 ### **Python3**
 
 ```python
-
+class Solution:
+    def countBits(self, n: int) -> List[int]:
+        ans = [0] * (n + 1)
+        for i in range(1, n + 1):
+            ans[i] = ans[i & (i - 1)] + 1
+        return ans
 ```
 
 ### **Java**
 
 ```java
-
+class Solution {
+    public int[] countBits(int n) {
+        int[] ans = new int[n + 1];
+        for (int i = 1; i <= n; ++i) {
+            ans[i] = ans[i & (i - 1)] + 1;
+        }
+        return ans;
+    }
+}
 ```
 
 ### **C++**
@@ -69,16 +82,25 @@
 class Solution {
 public:
     vector<int> countBits(int n) {
-        vector<int> res(n + 1);
-        for (int i = 1; i <= n; i++) {
-            res[i] = res[i & (i - 1)] + 1;
-        }
-
-        return res;
+        vector<int> ans(n + 1);
+        for (int i = 1; i <= n; ++i) ans[i] = ans[i & (i - 1)] + 1;
+        return ans;
     }
 };
 ```
 
+### **Go**
+
+```go
+func countBits(n int) []int {
+	ans := make([]int, n+1)
+	for i := 1; i <= n; i++ {
+		ans[i] = ans[i&(i-1)] + 1
+	}
+	return ans
+}
+```
+
 ### **...**
 
 ```

solution/0300-0399/0338.Counting Bits/Solution.cpp

@@ -1,11 +1,8 @@
 class Solution {
 public:
     vector<int> countBits(int n) {
-        vector<int> res(n + 1);
-        for (int i = 1; i <= n; i++) {
-            res[i] = res[i & (i - 1)] + 1;
-        }
-
-        return res;
+        vector<int> ans(n + 1);
+        for (int i = 1; i <= n; ++i) ans[i] = ans[i & (i - 1)] + 1;
+        return ans;
     }
 };

solution/0300-0399/0338.Counting Bits/Solution.go

@@ -0,0 +1,7 @@
+func countBits(n int) []int {
+	ans := make([]int, n+1)
+	for i := 1; i <= n; i++ {
+		ans[i] = ans[i&(i-1)] + 1
+	}
+	return ans
+}

solution/0300-0399/0338.Counting Bits/Solution.java

@@ -0,0 +1,9 @@
+class Solution {
+    public int[] countBits(int n) {
+        int[] ans = new int[n + 1];
+        for (int i = 1; i <= n; ++i) {
+            ans[i] = ans[i & (i - 1)] + 1;
+        }
+        return ans;
+    }
+}

solution/0300-0399/0338.Counting Bits/Solution.py

@@ -0,0 +1,6 @@
+class Solution:
+    def countBits(self, n: int) -> List[int]:
+        ans = [0] * (n + 1)
+        for i in range(1, n + 1):
+            ans[i] = ans[i & (i - 1)] + 1
+        return ans