✨ Add solution and testcases to problem 338

Author: Cori1109

leetcode/301-400/0338.Counting-Bits/README.md

@@ -1,15 +1,21 @@
 # [338.Counting Bits][title]
 
-> [!WARNING|style:flat]
-> This question is temporarily unanswered if you have good ideas. Welcome to [Create Pull Request PR](https://github.com/kylesliu/awesome-golang-algorithm)
-
 ## Description
 
+Given an integer n, return an array ans of length n + 1 such that for each i (0 <= i <= n), ans[i] is the number of 1's in the binary representation of i.
+
 **Example 1:**
 
 ```
-Input: a = "11", b = "1"
-Output: "100"
+Input: n = 2
+Output: [0,1,1]
+```
+
+**Example 2:**
+
+```
+Input: n = 5
+Output: [0,1,1,2,1,2]
 ```
 
 ## 题意

leetcode/301-400/0338.Counting-Bits/Solution.go

@@ -1,5 +1,13 @@
 package Solution
 
-func Solution(x bool) bool {
-	return x
+func Solution(n int) []int {
+	res := make([]int, n + 1)
+    for i := 1; i < n + 1; i++ {
+        if i % 2 == 0 {
+            res[i] = res[i/2]
+        } else {
+            res[i] = res[i/2] + 1
+        }
+    }
+    return res
 }

leetcode/301-400/0338.Counting-Bits/Solution_test.go

@@ -10,12 +10,12 @@ func TestSolution(t *testing.T) {
 	//	测试用例
 	cases := []struct {
 		name   string
-		inputs bool
-		expect bool
+		inputs int
+		expect []int
 	}{
-		{"TestCase", true, true},
-		{"TestCase", true, true},
-		{"TestCase", false, false},
+		{"TestCase", 2, []int{0,1,1}},
+		{"TestCase", 5, []int{0,1,1,2,1,2}},
+		{"TestCase", 10, []int{0,1,1,2,1,2,2,3,1,2,2}},
 	}
 
 	//	开始测试