feat: add solutions to lc problem: No.2166

No.2166.Design Bitset

Author: yanglbme

.github/workflows/starcharts.yml

@@ -1,6 +1,8 @@
 name: update-starcharts
 
 on:
+  schedule:
+    - cron: "0 0/12 * * *"
   workflow_dispatch:
 
 jobs:
@@ -14,4 +16,4 @@ jobs:
           github_token: ${{ secrets.ACTION_TOKEN }}
           svg_path: images/starcharts.svg
           commit_message: "chore: auto update starcharts"
-          stars_change: "50"
+          stars_change: ${{ secrets.STARS_CHANGE }}

README.md

@@ -180,10 +180,12 @@
 
 ## Stars 趋势
 
-<a href="https://github.com/doocs/leetcode/stargazers" target="_blank"><img src="https://starchart.cc/doocs/leetcode.svg" alt="Stargazers over time" /></a>
+<!-- 使用 https://starchart.cc/ 自动刷新 stars 数据，若有问题，可以使用 GitHub Action: starcharts.yml -->
+<!-- <a href="https://github.com/doocs/leetcode/stargazers" target="_blank"><img src="https://starchart.cc/doocs/leetcode.svg" alt="Stargazers over time" /></a> -->
 
-<!-- 这里先使用 https://starchart.cc/ 自动刷新 stars 数据，之后若有问题，可以使用 GitHub Action: starcharts.yml -->
-<!-- <a href="https://github.com/doocs/leetcode/stargazers" target="_blank"><img src="./images/starcharts.svg" alt="Stargazers over time" /></a> -->
+<!-- [![Star History Chart](https://api.star-history.com/svg?repos=doocs/leetcode&type=Date)](https://star-history.com/#doocs/leetcode) -->
+
+<a href="https://github.com/doocs/leetcode/stargazers" target="_blank"><img src="./images/starcharts.svg" alt="Stargazers over time" /></a>
 
 ## 贡献者
 

README_EN.md

@@ -174,9 +174,11 @@ You can also contribute to [doocs/leetcode](https://github.com/doocs/leetcode) u
 
 ## Stargazers over time
 
-<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://starchart.cc/doocs/leetcode.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> -->
+<!-- [![Star History Chart](https://api.star-history.com/svg?repos=doocs/leetcode&type=Date)](https://star-history.com/#doocs/leetcode) -->
+
+<a href="https://github.com/doocs/leetcode/stargazers" target="_blank"><img src="./images/starcharts.svg" alt="Stargazers over time" /></a>
 
 ## Contributors
 

solution/2100-2199/2166.Design Bitset/README.md

@@ -69,15 +69,244 @@ bs.toString(); // 返回 "01010" ，即 bitset 的当前组成情况。
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
+class Bitset:
 
+    def __init__(self, size: int):
+        self.a = ['0'] * size
+        self.b = ['1'] * size
+        self.cnt = 0
+
+    def fix(self, idx: int) -> None:
+        if self.a[idx] == '0':
+            self.a[idx] = '1'
+            self.cnt += 1
+        self.b[idx] = '0'
+
+    def unfix(self, idx: int) -> None:
+        if self.a[idx] == '1':
+            self.a[idx] = '0'
+            self.cnt -= 1
+        self.b[idx] = '1'
+
+    def flip(self) -> None:
+        self.a, self.b = self.b, self.a
+        self.cnt = len(self.a) - self.cnt
+
+    def all(self) -> bool:
+        return self.cnt == len(self.a)
+
+    def one(self) -> bool:
+        return self.cnt > 0
+
+    def count(self) -> int:
+        return self.cnt
+
+    def toString(self) -> str:
+        return ''.join(self.a)
+
+
+# Your Bitset object will be instantiated and called as such:
+# obj = Bitset(size)
+# obj.fix(idx)
+# obj.unfix(idx)
+# obj.flip()
+# param_4 = obj.all()
+# param_5 = obj.one()
+# param_6 = obj.count()
+# param_7 = obj.toString()
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+class Bitset {
+    private char[] a;
+    private char[] b;
+    private int cnt;
+
+    public Bitset(int size) {
+        a = new char[size];
+        b = new char[size];
+        Arrays.fill(a, '0');
+        Arrays.fill(b, '1');
+    }
+    
+    public void fix(int idx) {
+        if (a[idx] == '0') {
+            a[idx] = '1';
+            ++cnt;
+        }
+        b[idx] = '0';
+    }
+    
+    public void unfix(int idx) {
+        if (a[idx] == '1') {
+            a[idx] = '0';
+            --cnt;
+        }
+        b[idx] = '1';
+    }
+    
+    public void flip() {
+        char[] t = a;
+        a = b;
+        b = t;
+        cnt = a.length - cnt;
+    }
+    
+    public boolean all() {
+        return cnt == a.length;
+    }
+    
+    public boolean one() {
+        return cnt > 0;
+    }
+    
+    public int count() {
+        return cnt;
+    }
+    
+    public String toString() {
+        return String.valueOf(a);
+    }
+}
+
+/**
+ * Your Bitset object will be instantiated and called as such:
+ * Bitset obj = new Bitset(size);
+ * obj.fix(idx);
+ * obj.unfix(idx);
+ * obj.flip();
+ * boolean param_4 = obj.all();
+ * boolean param_5 = obj.one();
+ * int param_6 = obj.count();
+ * String param_7 = obj.toString();
+ */
+```
+
+### **C++**
+
+```cpp
+class Bitset {
+public:
+    string a, b;
+    int cnt = 0;
+
+    Bitset(int size) {
+        a = string(size, '0');
+        b = string(size, '1');
+    }
+    
+    void fix(int idx) {
+        if (a[idx] == '0') a[idx] = '1', ++cnt;
+        b[idx] = '0';
+    }
+    
+    void unfix(int idx) {
+        if (a[idx] == '1') a[idx] = '0', --cnt;
+        b[idx] = '1';
+    }
+    
+    void flip() {
+        swap(a, b);
+        cnt = a.size() - cnt;
+    }
+    
+    bool all() {
+        return cnt == a.size();
+    }
+    
+    bool one() {
+        return cnt > 0;
+    }
+    
+    int count() {
+        return cnt;
+    }
+    
+    string toString() {
+        return a;
+    }
+};
+
+/**
+ * Your Bitset object will be instantiated and called as such:
+ * Bitset* obj = new Bitset(size);
+ * obj->fix(idx);
+ * obj->unfix(idx);
+ * obj->flip();
+ * bool param_4 = obj->all();
+ * bool param_5 = obj->one();
+ * int param_6 = obj->count();
+ * string param_7 = obj->toString();
+ */
+```
+
+### **Go**
+
+```go
+type Bitset struct {
+	a   []byte
+	b   []byte
+	cnt int
+}
+
+func Constructor(size int) Bitset {
+	a := bytes.Repeat([]byte{'0'}, size)
+	b := bytes.Repeat([]byte{'1'}, size)
+	return Bitset{a, b, 0}
+}
+
+func (this *Bitset) Fix(idx int) {
+	if this.a[idx] == '0' {
+		this.a[idx] = '1'
+		this.cnt++
+	}
+	this.b[idx] = '0'
+}
+
+func (this *Bitset) Unfix(idx int) {
+	if this.a[idx] == '1' {
+		this.a[idx] = '0'
+		this.cnt--
+	}
+	this.b[idx] = '1'
+}
+
+func (this *Bitset) Flip() {
+	this.a, this.b = this.b, this.a
+	this.cnt = len(this.a) - this.cnt
+}
+
+func (this *Bitset) All() bool {
+	return this.cnt == len(this.a)
+}
+
+func (this *Bitset) One() bool {
+	return this.cnt > 0
+}
+
+func (this *Bitset) Count() int {
+	return this.cnt
+}
+
+func (this *Bitset) ToString() string {
+	return string(this.a)
+}
 
+/**
+ * Your Bitset object will be instantiated and called as such:
+ * obj := Constructor(size);
+ * obj.Fix(idx);
+ * obj.Unfix(idx);
+ * obj.Flip();
+ * param_4 := obj.All();
+ * param_5 := obj.One();
+ * param_6 := obj.Count();
+ * param_7 := obj.ToString();
+ */
 ```
 
 ### **TypeScript**