Leetcode Next Permutation 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
asked 2 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
asked 2 mins ago
A.LeeA.Lee
916
$endgroup$
add a comment |
0
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
asked 2 mins ago
A.LeeA.Lee
916
$endgroup$
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
python python-3.x
asked 2 mins ago
A.LeeA.Lee
916
asked 2 mins ago
A.LeeA.Lee
916
asked 2 mins ago
A.LeeA.Lee
916
asked 2 mins ago
A.LeeA.Lee
916
asked 2 mins ago
A.LeeA.Lee
916
916
add a comment |
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["\$", "\$"]]);
});
});
}, "mathjax-editing");
StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "196"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
draft saved
draft discarded
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f216998%2fleetcode-next-permutation-in-python%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
draft saved
draft discarded
Thanks for contributing an answer to Code Review Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
draft saved
draft discarded
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f216998%2fleetcode-next-permutation-in-python%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
