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 3e759f6

Browse files
update
1 parent cba0db9 commit 3e759f6

File tree

3 files changed

+4
-4
lines changed

3 files changed

+4
-4
lines changed

‎Backtracking/46-Permutations.py‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
1+
'''Leetcode- https://leetcode.com/problems/permutations/'''
12
'''
2-
Permutations
33
Given an array nums of distinct integers, return all the possible permutations. You can return the answer in any order.
44
55
Example 1:

‎Backtracking/78-Subsets.py‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
1-
'''
2-
Subsets
1+
'''Leetcode- https://leetcode.com/problems/subsets/'''
2+
'''
33
Given an integer array nums of unique elements, return all possible subsets (the power set).
44
55
The solution set must not contain duplicate subsets. Return the solution in any order.

‎Backtracking/90-Subsets-II.py‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
1+
'''Leetcode- https://leetcode.com/problems/subsets-ii/'''
12
'''
2-
Subsets II
33
Given an integer array nums that may contain duplicates, return all possible subsets (the power set).
44
55
The solution set must not contain duplicate subsets. Return the solution in any order.

0 commit comments

Comments
(0)

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