[Leetcode 46/47] Permutation I/II

preview_player
Показать описание

  1. basketwangCoding
  2. Leetcode
  3. Coding
  4. Algorithm
Рекомендации по теме
Permutations II - 0:11:47

Permutations II - Backtracking - Leetcode 47

[Leetcode 46/47] Permutation 0:21:49

[Leetcode 46/47] Permutation I/II

[Java] Leetcode 46/47. 0:18:16

[Java] Leetcode 46/47. Permutations I/II [Backtracking #4]

Backtracking: Permutations - 0:09:43

Backtracking: Permutations - Leetcode 46 - Python

Leetcode 47 | 0:13:00

Leetcode 47 | Permutations II

Permutations (LeetCode 46) 0:16:55

Permutations (LeetCode 46) | Full solution with backtracking examples | Interview | Study Algorithms

Permutations 2 (LeetCode 0:13:49

Permutations 2 (LeetCode 47) | Full solution with backtracking examples | Study Algorithms

Permutations - leetcode 0:07:56

Permutations - leetcode 46 - Recursive

Permutations II | 0:05:57

Permutations II | Leetcode 47 | Backtracking Playlist | Live coding session

LeetCode Q 47. 0:06:46

LeetCode Q 47. Permutations II

Leetcode 47: Permutations 0:20:44

Leetcode 47: Permutations II

Permutations - Leetcode 0:09:42

Permutations - Leetcode 46 - Recursive Backtracking (Python)

Permutations | Live 0:05:45

Permutations | Live Coding with Explanation | Leetcode #46

EN) Leetcode 47. 0:03:26

EN) Leetcode 47. Permutations II

LeetCode 47: Permutations 0:01:35

LeetCode 47: Permutations II

46. Permutations Leetcode 0:11:35

46. Permutations Leetcode

[Day12] Leetcode Q47 0:06:59

[Day12] Leetcode Q47 - Permutations II

Permutations II - 0:06:16

Permutations II - Leetcode 47 - JavaScript

Permutations II - 0:05:16

Permutations II - Leetcode 47

47. Permutations II 0:13:27

47. Permutations II - Day 12/31 Leetcode May Challenge

Leetcode 46. Permutations 0:10:06

Leetcode 46. Permutations : Introduction to backtracking

Leetcode 47. Permutations 0:06:29

Leetcode 47. Permutations II (Backtracking)

LeetCode 47 | 0:07:59

LeetCode 47 | Permutations II | Backtrack, Sort | Java

47. Permutations II 0:08:33

47. Permutations II - Day 12/30 Leetcode November Challenge

Комментарии
Автор

Very intuitive and clear! This is the only video that goes through the recursion process step-by-step. Now I have much better understanding of the nuts and bolts of recursion.

KGuan-dnvv
Автор

Performs better than O(N * N!), and a bit slower than O(N!). Space complexity : O(N!) since one has to keep N! solutions.

streambai
Автор

letter combination， type是 [str, str, str, str] 理论上说，如果不删除新添加的char 但其实函数跑完后并不是这样的。 能请前辈解答一下这个问题么？ 谢谢

jasonshen
Автор

请问为什么要设定clist跟set两个数组呢？我把code里面涉及到set的都删除了，除了第12行的set改成了clist,

zy
Автор

basketwang, could u elaborate the time and space complexity for backtracking?

bartholdic
Автор

用楼主的思路拿python写了一遍，2, 2, 1, 1这个case总是过不了...

sabrinawang
Автор

有一点不懂, 比如 clist是[1, 2, 3] 了，此时满足了clist.size( ) == nums.length, res.ad( ); 然后应该要移除3了，但是set.remove( )是写在else中的, 满足了if之后怎么进入else语句呢?

leixia
Автор

为什么 Permutation II 从JAVA 改写成Python 就出错了，哪位大神能帮我看看吗？


if len(nums) <=1: return [nums]
nums.sort()
ans= []

def dfs(nums, curr):
if len(curr)== len(nums):
ans.append(curr[:])
return
preNum = nums[0]-1
for i in range(len(nums)):
if nums[i] not in curr and nums[i] !=preNum:
preNum= nums[i]
curr.append(nums[i])
dfs(nums, curr)
curr.pop()
dfs(nums, [])
return ans

deutscherkaiserwilhelmii
Автор

您好，请问条件里的false 是如何被初始化的？直接默认false进行吗？ 谢谢

carlgauss
Автор

nums[0] -1 会不会越界呀？不如比较 status[i] || i > 0 && nums[i] == nums[i - 1] && !status[i - 1]

AndyWang
Автор

Could you please captions to your videos

rockysingh
Автор

您好，Permutations II有个疑问，递归函数之前 int preNum = nums[0] - 1;那么每次调用递归的时候，preNum不会每次都初始化为 nums[0] - 1再进入for循环吗？

dan
join shbcf.ru