Leetcode - Next Permutation (Python)

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

January 2021 Leetcode Challenge
Leetcode - Next Permutation #31

Timothy H Chang

Рекомендации по теме

Комментарии

Bro I love the way u explain . Understood the algorithm perfectly!!

💌

sailokesh

Like the way you walk through these problems. The mind process was logical and easy to follow.

chrisshao

Love the video and explanation! You're the GOAT! Quick question:
If you used reversed instead of sort on line 14 wouldn't that make it a little bit of a better solution since sort has O(nlogn) Time complexity and reversed has Linear Time Complexity?

moezabbes

Neat and concise explanation of the core idea, thanks!

oleksiimartens

Thanku so so much... love from Jaipur, India.🤗

dashrathsinghkaviya

You have a way of explanation that make me understand the problem right from the first time, and it's short, I'm so jealous anyway thank you a lot~

modreamer

Thank you for the great solution, only feedback was the reverse like the previous comments:D

mohfocus

How would I even know that's the algo to find next permutation. I just figure the next permutation by nature, not that complicated algo... lol

davidcheung

Hey Tim, find your videos very helpful. I may not be able to like or comment on all due to office laptop restrictions. 😅 But really love them.. keep making more and more

anjaliiyer

You dont need sorting for next permutation

carefree_ladka

Why did understanding the question took so long XD
Finally understood it. So easy

dARKfnXx

Here's my Python implementation:

class Solution(object):
def nextPermutation(self, nums):
"""
:type nums: List[int]
:rtype: None Do not return anything, modify nums in-place instead.
"""
i = len(nums) - 2
while i >= 0 and nums[i] >= nums[i+1]:
i -= 1

if i < 0:
nums.sort()
return

j = len(nums) - 1
while j >= 0 and nums[i] >= nums[j]:
j -= 1

nums[i], nums[j] = nums[j], nums[i]
nums[i+1:] = nums[i+1:][::-1]

edwardteach

There's always a better Asian
Now I don't have any doubt on it

abhishektiwari

Leetcode - Next Permutation (Python)

Leetcode - Next Permutation (Python)

Next Permutation Python Solution - LeetCode #31

NEXT PERMUTATION | LEETCODE # 31 | PYTHON OPTIMAL SOLUTION

Next Permutation | Leet code 31 | Theory explained + Python code

Next Permutation - LeetCode 31 - Python [O(n) time and O(1) Space!]

LEETCODE 31 NEXT PERMUTATION PYTHON

Compute The Next Permutation of A Numeric Sequence - Case Analysis ('Next Permutation' on ...

Next Permutation | O(n) | Python | Code Explanation | Leetcode - 31

LeetCode 31 Next Permutation Python

Permutations - Leetcode 46

Next Permutation - Intuition in Detail 🔥 | Brute to Optimal

Next Permutation - LeetCode #31 with Python, JavaScript, Java and C++

Permutations - Leetcode 46 - Python

Next Permutation | Leetcode #31

Backtracking: Permutations - Leetcode 46 - Python

Next Permutation | Live Coding with Explanation | Leetcode - 31

Permutations - Leetcode 46 - Recursive Backtracking (Python)

Next Permutation | LeetCode 31 | Python | Ruby

Leetcode 31. Next Permutation in Python | Python Leetcode | Python Coding Tutorial | Python ASMR

31. Next Permutation Python LeetCode Solution #leetcode #coding #codingproblems #python #tech

Google Backtracking Interview Question - Permutations - Leetcode 46

NEXT PERMUTATION | Leetcode | Know the Intuition behind the Algorithm | C++ | Java | Brute-Optimal

Coding Interviews Need Backtracking! | Permutations - Leetcode 46

Leetcode 31. Next Permutation | FAANG Coding Question | Python |