Palindrome Linked List #49
Closed
Conversation
This file contains 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
Roman to Integer
Counting Bits
Product of Array Except Self
oda
reviewed
Dec 17, 2024
|
|
||
| /* | ||
| 時間：５分 | ||
| スライスに変換し、Palindromeかどうかを比較するようにした。 |
There was a problem hiding this comment.
この問題は、この方法で現実的にはいいでしょう。
面接だったら追加空間計算量を定数でする方法、つまり、「はじめに中間地点を探して、そこから後半をひっくり返して、両端から同じものが並んでいるかを確認した後に、後半をもう一回ひっくり返す」というのを書いて欲しいと言われるのだろうなあと思います。
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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.
Palindrome Linked Listを解きました。レビューをお願いします。
問題：https://leetcode.com/problems/palindrome-linked-list/
言語：Go