feat: add solutions to lc problem: No.0078

No.0078.Subsets

Author: yanglbme

solution/0000-0099/0078.Subsets/README.md

@@ -40,6 +40,10 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
+**方法一：回溯**
+
+**方法二：二进制枚举**
+
 <!-- tabs:start -->
 
 ### **Python3**
@@ -63,6 +67,19 @@ class Solution:
         return ans
 ```
 
+```python
+class Solution:
+    def subsets(self, nums: List[int]) -> List[List[int]]:
+        ans = []
+        for mask in range(1 << len(nums)):
+            t = []
+            for i, v in enumerate(nums):
+                if (mask >> i) & 1:
+                    t.append(v)
+            ans.append(t)
+        return ans
+```
+
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
@@ -92,6 +109,25 @@ class Solution {
 }
 ```
 
+```java
+class Solution {
+    public List<List<Integer>> subsets(int[] nums) {
+        int n = nums.length;
+        List<List<Integer>> ans = new ArrayList<>();
+        for (int mask = 0; mask < 1 << n; ++mask) {
+            List<Integer> t = new ArrayList<>();
+            for (int i = 0; i < n; ++i) {
+                if (((mask >> i) & 1) == 1) {
+                    t.add(nums[i]);
+                }
+            }
+            ans.add(t);
+        }
+        return ans;
+    }
+}
+```
+
 ### **C++**
 
 ```cpp
@@ -118,6 +154,30 @@ public:
 };
 ```
 
+```cpp
+class Solution {
+public:
+    vector<vector<int>> subsets(vector<int>& nums) {
+        vector<vector<int>> ans;
+        vector<int> t;
+        int n = nums.size();
+        for (int mask = 0; mask < 1 << n; ++mask)
+        {
+            t.clear();
+            for (int i = 0; i < n; ++i)
+            {
+                if ((mask >> i) & 1)
+                {
+                    t.push_back(nums[i]);
+                }
+            }
+            ans.push_back(t);
+        }
+        return ans;
+    }
+};
+```
+
 ### **Go**
 
 ```go
@@ -140,6 +200,23 @@ func subsets(nums []int) [][]int {
 }
 ```
 
+```go
+func subsets(nums []int) [][]int {
+	var ans [][]int
+	n := len(nums)
+	for mask := 0; mask < 1<<n; mask++ {
+		t := []int{}
+		for i, v := range nums {
+			if ((mask >> i) & 1) == 1 {
+				t = append(t, v)
+			}
+		}
+		ans = append(ans, t)
+	}
+	return ans
+}
+```
+
 ### **Rust**
 
 ```rust

solution/0000-0099/0078.Subsets/README_EN.md

@@ -57,6 +57,19 @@ class Solution:
         return ans
 ```
 
+```python
+class Solution:
+    def subsets(self, nums: List[int]) -> List[List[int]]:
+        ans = []
+        for mask in range(1 << len(nums)):
+            t = []
+            for i, v in enumerate(nums):
+                if (mask >> i) & 1:
+                    t.append(v)
+            ans.append(t)
+        return ans
+```
+
 ### **Java**
 
 ```java
@@ -84,6 +97,25 @@ class Solution {
 }
 ```
 
+```java
+class Solution {
+    public List<List<Integer>> subsets(int[] nums) {
+        int n = nums.length;
+        List<List<Integer>> ans = new ArrayList<>();
+        for (int mask = 0; mask < 1 << n; ++mask) {
+            List<Integer> t = new ArrayList<>();
+            for (int i = 0; i < n; ++i) {
+                if (((mask >> i) & 1) == 1) {
+                    t.add(nums[i]);
+                }
+            }
+            ans.add(t);
+        }
+        return ans;
+    }
+}
+```
+
 ### **C++**
 
 ```cpp
@@ -110,6 +142,30 @@ public:
 };
 ```
 
+```cpp
+class Solution {
+public:
+    vector<vector<int>> subsets(vector<int>& nums) {
+        vector<vector<int>> ans;
+        vector<int> t;
+        int n = nums.size();
+        for (int mask = 0; mask < 1 << n; ++mask)
+        {
+            t.clear();
+            for (int i = 0; i < n; ++i)
+            {
+                if ((mask >> i) & 1)
+                {
+                    t.push_back(nums[i]);
+                }
+            }
+            ans.push_back(t);
+        }
+        return ans;
+    }
+};
+```
+
 ### **Go**
 
 ```go
@@ -132,6 +188,23 @@ func subsets(nums []int) [][]int {
 }
 ```
 
+```go
+func subsets(nums []int) [][]int {
+	var ans [][]int
+	n := len(nums)
+	for mask := 0; mask < 1<<n; mask++ {
+		t := []int{}
+		for i, v := range nums {
+			if ((mask >> i) & 1) == 1 {
+				t = append(t, v)
+			}
+		}
+		ans = append(ans, t)
+	}
+	return ans
+}
+```
+
 ### **Rust**
 
 ```rust

solution/1600-1699/1601.Maximum Number of Achievable Transfer Requests/README.md

@@ -209,8 +209,7 @@ var maximumRequests = function (n, requests) {
         let d = new Array(n).fill(0);
         for (let i = 0; i < m; ++i) {
             if ((x >> i) & 1) {
-                const f = requests[i][0];
-                const t = requests[i][1];
+                const [f, t] = requests[i];
                 d[f]--;
                 d[t]++;
             }

solution/1600-1699/1601.Maximum Number of Achievable Transfer Requests/README_EN.md

@@ -192,8 +192,7 @@ var maximumRequests = function (n, requests) {
         let d = new Array(n).fill(0);
         for (let i = 0; i < m; ++i) {
             if ((x >> i) & 1) {
-                const f = requests[i][0];
-                const t = requests[i][1];
+                const [f, t] = requests[i];
                 d[f]--;
                 d[t]++;
             }

solution/1600-1699/1601.Maximum Number of Achievable Transfer Requests/Solution.js

@@ -8,8 +8,7 @@ var maximumRequests = function (n, requests) {
         let d = new Array(n).fill(0);
         for (let i = 0; i < m; ++i) {
             if ((x >> i) & 1) {
-                const f = requests[i][0];
-                const t = requests[i][1];
+                const [f, t] = requests[i];
                 d[f]--;
                 d[t]++;
             }