Ttykuu

Today is the Center

How to find program name(s) of an installed package?

can i play a electric guitar through a bass amp?

Why are electrically insulating heatsinks so rare? Is it just cost?

Why does Kotter return in Welcome Back Kotter?

Has the BBC provided arguments for saying Brexit being cancelled is unlikely?

How to format long polynomial?

Theorems that impeded progress

"to be prejudice towards/against someone" vs "to be prejudiced against/towards someone"

The use of multiple foreign keys on same column in SQL Server

Mathematical cryptic clues

What are the differences between the usage of 'it' and 'they'?

Do I have a twin with permutated remainders?

What defenses are there against being summoned by the Gate spell?

Why doesn't H₄O²⁺ exist?

Can I make popcorn with any corn?

Fencing style for blades that can attack from a distance

Is it unprofessional to ask if a job posting on GlassDoor is real?

I’m planning on buying a laser printer but concerned about the life cycle of toner in the machine

If I cast Expeditious Retreat, can I Dash as a bonus action on the same turn?

Why "Having chlorophyll without photosynthesis is actually very dangerous" and "like living with a bomb"?

Have astronauts in space suits ever taken selfies? If so, how?

Why was the small council so happy for Tyrion to become the Master of Coin?

Is this a crack on the carbon frame?

Leetcode Next Permutation in python

Pathname matching and listing programPython Octree ImplementationPermutation index PythonThread-safe RLockedListPython finding next word permutation with function generatorLeetcode MaxStack in PythonThe next prime number in PythonLeetcode Two Sum code in PythonLeetcode Three Sum in PythonLeetcode 3Sum problem using hashmap in Python

.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty margin-bottom:0;

0

$begingroup$

My solution to Leetcode Next Permutation in Python. anyone can help me to review the code and wondering

1:if following code is Big O(N)

2: how can I use inline swap with islice to replace swap function?

 def nextPermutation(self, nums):
 """
 :type nums: List[int]
 :rtype: void Do not return anything, modify nums in-place instead.
 """
 def swap(i, j):
 while i < j:
 nums[i], nums[j] = nums[j], nums[i]
 i += 1
 j -= 1

 n = len(nums)
 index = n - 2
 while index > -1 and nums[index] >= nums[index + 1]:
 index -= 1
 if index == -1:
 swap(0, n - 1)
 return
 i = n - 1
 while i > index and nums[i] <= nums[index]:
 i -= 1
 nums[i], nums[index] = nums[index], nums[i]
 swap(index + 1, n - 1)

python python-3.x

share|improve this question

asked 12 mins ago

A.LeeA.Lee

916

$endgroup$

add a comment | 

0

$begingroup$

My solution to Leetcode Next Permutation in Python. anyone can help me to review the code and wondering

1:if following code is Big O(N)

2: how can I use inline swap with islice to replace swap function?

 def nextPermutation(self, nums):
 """
 :type nums: List[int]
 :rtype: void Do not return anything, modify nums in-place instead.
 """
 def swap(i, j):
 while i < j:
 nums[i], nums[j] = nums[j], nums[i]
 i += 1
 j -= 1

 n = len(nums)
 index = n - 2
 while index > -1 and nums[index] >= nums[index + 1]:
 index -= 1
 if index == -1:
 swap(0, n - 1)
 return
 i = n - 1
 while i > index and nums[i] <= nums[index]:
 i -= 1
 nums[i], nums[index] = nums[index], nums[i]
 swap(index + 1, n - 1)

python python-3.x

share|improve this question

asked 12 mins ago

A.LeeA.Lee

916

$endgroup$

add a comment | 

$begingroup$

My solution to Leetcode Next Permutation in Python. anyone can help me to review the code and wondering

1:if following code is Big O(N)

2: how can I use inline swap with islice to replace swap function?

 def nextPermutation(self, nums):
 """
 :type nums: List[int]
 :rtype: void Do not return anything, modify nums in-place instead.
 """
 def swap(i, j):
 while i < j:
 nums[i], nums[j] = nums[j], nums[i]
 i += 1
 j -= 1

 n = len(nums)
 index = n - 2
 while index > -1 and nums[index] >= nums[index + 1]:
 index -= 1
 if index == -1:
 swap(0, n - 1)
 return
 i = n - 1
 while i > index and nums[i] <= nums[index]:
 i -= 1
 nums[i], nums[index] = nums[index], nums[i]
 swap(index + 1, n - 1)

python python-3.x

share|improve this question

asked 12 mins ago

A.LeeA.Lee

916

$endgroup$

 def nextPermutation(self, nums):
 """
 :type nums: List[int]
 :rtype: void Do not return anything, modify nums in-place instead.
 """
 def swap(i, j):
 while i < j:
 nums[i], nums[j] = nums[j], nums[i]
 i += 1
 j -= 1

 n = len(nums)
 index = n - 2
 while index > -1 and nums[index] >= nums[index + 1]:
 index -= 1
 if index == -1:
 swap(0, n - 1)
 return
 i = n - 1
 while i > index and nums[i] <= nums[index]:
 i -= 1
 nums[i], nums[index] = nums[index], nums[i]
 swap(index + 1, n - 1)

share|improve this question

asked 12 mins ago

A.LeeA.Lee

916

share|improve this question

asked 12 mins ago

A.LeeA.Lee

916

asked 12 mins ago

A.LeeA.Lee

916

asked 12 mins ago

A.LeeA.Lee

916