-
-
Notifications
You must be signed in to change notification settings - Fork 245
[sonjh1217] WEEK 02 solutions #1762
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Merged
Merged
Changes from all commits
Commits
Show all changes
2 commits
Select commit
Hold shift + click to select a range
File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
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
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,24 @@ | ||
class Solution { | ||
func productExceptSelf(_ nums: [Int]) -> [Int] { | ||
var answer = [Int]() | ||
var product:Int = 1 | ||
for i in (0..<nums.count) { | ||
if i > 0 { | ||
product *= nums[i-1] | ||
} | ||
answer.append(product) | ||
} | ||
|
||
product = 1 | ||
for i in (1..<nums.count) { | ||
product *= nums[nums.count-i] | ||
answer[nums.count-1-i] *= product | ||
} | ||
|
||
return answer | ||
|
||
//시간 복잡도 O(n) | ||
//공간 복잡도 O(n) | ||
} | ||
} | ||
|
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. 시간복잡도 뿐만 아니라 공간복잡도까지 고려하여 코드를 작성하신 부분이 인상깊습니다. 저와 다른 풀이로, 문자의 개수를 세어서 count를 확인하고 있어서 배워갑니다. |
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
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,22 @@ | ||
class Solution { | ||
func isAnagram(_ s: String, _ t: String) -> Bool { | ||
var count = [Character:Int]() | ||
for char in s { | ||
count[char, default: 0] += 1 | ||
} | ||
|
||
for char in t { | ||
count[char, default: 0] -= 1 | ||
|
||
if count[char]! < 0 { | ||
return false | ||
} | ||
} | ||
|
||
return count.values.allSatisfy {$0 == 0} | ||
|
||
//시간 복잡도 O(n) | ||
//공간 복잡도 O(n) | ||
} | ||
} | ||
|
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.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
배열을 재활용하여 메모리를 효율적으로 사용하고 있는 점이 좋은 것 같아요. 좋은 코드 잘 읽었습니다.