How to use deque from a mutable list,find the order from list
up vote
0
down vote
favorite
I wrote a solution to reveal cards in increasing order. If there is a better way for me to replace the stock by using deque library so I do not need to pop and insert value into index 0 in every loop and also keep the same Big O(N)?
ex: Input: [17,13,11,2,3,5,7], Output: [2,13,3,11,5,17,7]
pop 2: list turns into [3,11,5,17,7,13]
pop 3: list turns into [5,17,7,13,11]
class Solution:
def deckRevealedIncreasing(self, deck):
"""
:type deck: List[int]
:rtype: List[int]
"""
s = sorted(deck)
stock =
while s:
if stock:
tmp = stock.pop()
stock.insert(0, tmp)
stock.insert(0, s.pop())
return stock
python-3.x
add a comment |
up vote
0
down vote
favorite
I wrote a solution to reveal cards in increasing order. If there is a better way for me to replace the stock by using deque library so I do not need to pop and insert value into index 0 in every loop and also keep the same Big O(N)?
ex: Input: [17,13,11,2,3,5,7], Output: [2,13,3,11,5,17,7]
pop 2: list turns into [3,11,5,17,7,13]
pop 3: list turns into [5,17,7,13,11]
class Solution:
def deckRevealedIncreasing(self, deck):
"""
:type deck: List[int]
:rtype: List[int]
"""
s = sorted(deck)
stock =
while s:
if stock:
tmp = stock.pop()
stock.insert(0, tmp)
stock.insert(0, s.pop())
return stock
python-3.x
add a comment |
up vote
0
down vote
favorite
up vote
0
down vote
favorite
I wrote a solution to reveal cards in increasing order. If there is a better way for me to replace the stock by using deque library so I do not need to pop and insert value into index 0 in every loop and also keep the same Big O(N)?
ex: Input: [17,13,11,2,3,5,7], Output: [2,13,3,11,5,17,7]
pop 2: list turns into [3,11,5,17,7,13]
pop 3: list turns into [5,17,7,13,11]
class Solution:
def deckRevealedIncreasing(self, deck):
"""
:type deck: List[int]
:rtype: List[int]
"""
s = sorted(deck)
stock =
while s:
if stock:
tmp = stock.pop()
stock.insert(0, tmp)
stock.insert(0, s.pop())
return stock
python-3.x
I wrote a solution to reveal cards in increasing order. If there is a better way for me to replace the stock by using deque library so I do not need to pop and insert value into index 0 in every loop and also keep the same Big O(N)?
ex: Input: [17,13,11,2,3,5,7], Output: [2,13,3,11,5,17,7]
pop 2: list turns into [3,11,5,17,7,13]
pop 3: list turns into [5,17,7,13,11]
class Solution:
def deckRevealedIncreasing(self, deck):
"""
:type deck: List[int]
:rtype: List[int]
"""
s = sorted(deck)
stock =
while s:
if stock:
tmp = stock.pop()
stock.insert(0, tmp)
stock.insert(0, s.pop())
return stock
python-3.x
python-3.x
asked 5 mins ago
A.Lee
261
261
add a comment |
add a comment |
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
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.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- 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.
To learn more, see our tips on writing great answers.
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%2f208855%2fhow-to-use-deque-from-a-mutable-list-find-the-order-from-list%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