Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
24 changes: 24 additions & 0 deletions product-of-array-except-self/sonjh1217.swift
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

배열을 재활용하여 메모리를 효율적으로 사용하고 있는 점이 좋은 것 같아요. 좋은 코드 잘 읽었습니다.

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)
}
}

22 changes: 22 additions & 0 deletions valid-anagram/sonjh1217.swift
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

시간복잡도 뿐만 아니라 공간복잡도까지 고려하여 코드를 작성하신 부분이 인상깊습니다. 저와 다른 풀이로, 문자의 개수를 세어서 count를 확인하고 있어서 배워갑니다.

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)
}
}