-
-
Notifications
You must be signed in to change notification settings - Fork 361
[dolphinflow86] WEEK 05 Solutions #2762
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
base: main
Are you sure you want to change the base?
Changes from all commits
File filter
Filter by extension
Conversations
Jump to
Diff view
Diff view
There are no files selected for viewing
|
Contributor
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. 🏷️ 알고리즘 패턴 분석
📊 시간/공간 복잡도 분석
피드백: 최소값과 최대 이익을 변수로 유지하며 배열을 한 번만 지나므로 시간 복잡도는 선형이고 추가 공간은 상수이다. 개선 제안: 현재 구현이 적절해 보입니다. |
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,13 @@ | ||
| # 1) Keep track of local minimum and use local minimum to update max profile while interating prices. | ||
| # TC: O(N) where N is the length of prices | ||
| # SC: O(1) | ||
| class Solution: | ||
| def maxProfit(self, prices: List[int]) -> int: | ||
| min_price = prices[0] | ||
| max_profit = 0 | ||
|
|
||
| for price in prices: | ||
| max_profit = max(max_profit, price - min_price) | ||
| min_price = min(min_price, price) | ||
|
Comment on lines
+9
to
+11
Contributor
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. 사소하지만 더 최적화 할 수 있는 부분은 min, max 일 거 같아요. 고민해보셔도 좋을 거 같습니다! |
||
|
|
||
| return max_profit | ||
|
Contributor
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. 🏷️ 알고리즘 패턴 분석
📊 시간/공간 복잡도 분석
풀이 1:
|
| 복잡도 | |
|---|---|
| Time | O(n) |
| Space | O(1) |
피드백: 정확히 각 문자열의 길이를 앞에 기록하므로 구분자 없이도 경계 구분이 가능하다.
개선 제안: 현재 구현이 적절해 보입니다.
풀이 2: Solution.decode — Time: O(n) / Space: O(k)
| 복잡도 | |
|---|---|
| Time | O(n) |
| Space | O(k) |
피드백: 루프를 통해 순차적으로 디코딩하므로 시간 복잡도는 선형이고 결과를 저장하는 공간이 필요하다.
개선 제안: 현재 구현이 적절해 보입니다.
💡 풀이에 시간/공간 복잡도를 주석으로 남겨보세요!
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,30 @@ | ||
| # 1) Prepend each word with its length and a delimiter '%'. | ||
| # TC: encode O(N) where N is the len(str), decode O(N) where N is the len(s) | ||
| # SC: O(N) for storing the encoded string | ||
| class Solution: | ||
|
|
||
| def encode(self, strs: list[str]) -> str: | ||
| answer = "" | ||
| for s in strs: | ||
| answer += f"{len(s)}%{s}" | ||
| return answer | ||
|
|
||
| def decode(self, s: str) -> list[str]: | ||
| left = 0 | ||
| right = 0 | ||
| str_len = len(s) | ||
|
|
||
| result = [] | ||
| while right < str_len: | ||
| while s[right] != "%": | ||
| right += 1 | ||
|
|
||
| num_len = int(s[left:right]) | ||
| start = right + 1 | ||
| word = s[start : start + num_len] | ||
| result.append(word) | ||
|
|
||
| left = start + num_len | ||
| right = left | ||
|
|
||
| return result |
|
Contributor
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. 🏷️ 알고리즘 패턴 분석
📊 시간/공간 복잡도 분석
피드백: 문자열 정렬이 주된 비용이며, 그룹화를 위한 해시맵 사용으로 효율적으로 묶을 수 있다. 개선 제안: 현재 구현이 적절해 보입니다.
|
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,13 @@ | ||
| # 1) Group words by their sorted form using defaultdict. While iterating the strs, sort each word and append original word to the corresponding list. After then convert dict to 2 dimensional list and return the list. | ||
| # TC: O(N*LlogL) where N is length of strs, L is max length of a word. | ||
| # SC: O(N*L) | ||
|
|
||
| class Solution: | ||
| def groupAnagrams(self, strs: List[str]) -> List[List[str]]: | ||
| groups = defaultdict(list) | ||
|
|
||
| for str in strs: | ||
| sorted_str = "".join(sorted(str)) | ||
| groups[sorted_str].append(str) | ||
|
|
||
| return list(groups.values()) |
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.
깔끔하게 잘 해결해 주셨네요!
best time to buy and sell stock, 즉 해당 문제는
뒤에 로마 숫자를 붙혀서 1, 2, 3, 4, 5 총 다섯종류가 있는데요
dp 연습하기에 정말 괜찮은 문제라고 생각해서
2번문제
II는 한번 풀어보시길 추천드려요!
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.
오! 네 문제 추천 감사합니다! 한번 풀어볼게요 👍