Open
Conversation
URL: https://leetcode.com/problems/move-zeroes/ 問題文: Given an integer array nums, move all 0's to the end of it while maintaining the relative order of the non-zero elements. Note that you must do this in-place without making a copy of the array.
nodchip
reviewed
Jun 14, 2024
|
|
||
| ```python | ||
|
|
||
| class Solution: |
There was a problem hiding this comment.
この問題のように、最後に 0 埋めをするのであれば、この解法が一番スマートだと思います。
| """ | ||
| Do not return anything, modify nums in-place instead. | ||
| """ | ||
| nonzero_count = 0 |
| @@ -0,0 +1,118 @@ | |||
| ## Step1 | |||
|
|
|||
| - 最初にパッと思いついたやつ、時間計算量O(len(nums)^2)なので、ギリギリ | |||
There was a problem hiding this comment.
この問題を読んだとき、一番初めに思い付いたのは C++ の標準ライブラリの std::remove() でした。
https://cpprefjp.github.io/reference/algorithm/remove.html
| for i in range(len(nums)): | ||
| if nums[i]: | ||
| nonzero_index = i | ||
| while nonzero_index-1 >= 0 and nums[nonzero_index - 1] == 0: |
There was a problem hiding this comment.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
URL: https://leetcode.com/problems/move-zeroes/
問題文: Given an integer array nums, move all 0's to the end of it while maintaining the relative order of the non-zero elements.
Note that you must do this in-place without making a copy of the array.