Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit 454fc2a

Browse files
authored
Add files via upload
1 parent 0f1b762 commit 454fc2a

File tree

1 file changed

+62
-0
lines changed

1 file changed

+62
-0
lines changed

‎Subsets/find_subsets.py‎

Lines changed: 62 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,62 @@
1+
def get_bit(num, bit):
2+
3+
temp = (1 << bit)
4+
temp = temp & num
5+
6+
if temp == 0:
7+
return 0
8+
9+
return 1
10+
11+
12+
13+
def find_all_subsets(nums):
14+
15+
subsets = []
16+
17+
if not nums:
18+
return [[]]
19+
20+
else:
21+
subsets_count = 2 ** len(nums)
22+
23+
for i in range(0, subsets_count):
24+
subset = set()
25+
26+
for j in range(0, len(nums)):
27+
if get_bit(i, j) == 1 and nums[j] not in subset:
28+
subset.add(nums[j])
29+
30+
if i == 0:
31+
subsets.append([])
32+
33+
else:
34+
subsets.append(list(subset))
35+
36+
return subsets
37+
38+
39+
40+
# Time Complexity = O(2^n * n)
41+
# Space Complexity = O(n)
42+
43+
44+
45+
#################################################################
46+
47+
48+
49+
def main():
50+
nums = [[], [2, 5, 7], [1, 2], [1, 2, 3, 4], [7, 3, 1, 5]]
51+
52+
for i in range(len(nums)):
53+
print(i + 1, ". Set: ", nums[i], sep='')
54+
subsets = find_all_subsets(nums[i])
55+
print(" Subsets:", subsets)
56+
print("-"*100)
57+
58+
59+
if __name__ == '__main__':
60+
main()
61+
62+

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /