[이지민] - 구간 합 구하기 5, 작업, 도넛과 막대 그래프 #217
Merged
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
bngsh
approved these changes
Mar 10, 2024
Comment on lines
+13
to
+15
| for j in range(1, n + 1): | ||
| tmp.append(tmp[-1] + numbers[i - 1][j - 1]) | ||
| sub_info.append(sum_info[i - 1][j] + tmp[-1]) |
There was a problem hiding this comment.
애초부터 구간합도 이렇게 반복 한번으로 저장해둘 수 있었군요
Comment on lines
+54
to
+57
| if e == first: | ||
| type = 1 | ||
| else: | ||
| type = 4 |
| check_students(i, reverse_students, visited) | ||
|
|
||
| if all(visited): | ||
| result += 1 |
There was a problem hiding this comment.
제가 부등호에 현혹돼서 너무 어렵게 생각했나봐요 bfs 좋네용
jhg3410
approved these changes
Mar 10, 2024
Comment on lines
+10
to
+15
| for i in range(1, n + 1): | ||
| sub_info = [0] | ||
| tmp = [0] | ||
| for j in range(1, n + 1): | ||
| tmp.append(tmp[-1] + numbers[i - 1][j - 1]) | ||
| sub_info.append(sum_info[i - 1][j] + tmp[-1]) |
There was a problem hiding this comment.
tmp.append 로 왼쪽과 덧셈, sub_info.append 로 위쪽과 덧셈이군요!!👍
| return result | ||
|
|
||
|
|
||
| def check_graph(first, edge_info, visited, point): |
There was a problem hiding this comment.
색다르게 푸셔서 좋았어요! 👍
조건문으로 꼼꼼하게 비교하는 느낌?
soopeach
approved these changes
Mar 10, 2024
Comment on lines
+10
to
+15
| for i in range(1, n + 1): | ||
| sub_info = [0] | ||
| tmp = [0] | ||
| for j in range(1, n + 1): | ||
| tmp.append(tmp[-1] + numbers[i - 1][j - 1]) | ||
| sub_info.append(sum_info[i - 1][j] + tmp[-1]) |
|
|
||
|
|
||
| def solution(edges): | ||
| edge_size = max(list(itertools.chain(*edges))) |
There was a problem hiding this comment.
edges의 타입이 정의되어있지 않아서 요런식으로 크기를 구해야하는 건가요??
There was a problem hiding this comment.
사실 문제에 순서대로 번호를 붙인다고 안쓰여져있어서 정석인 방식은 아닌 것 같아요..!!
Comment on lines
+18
to
+26
| while queue: | ||
| nxt = queue.popleft() | ||
| if not visited[nxt]: | ||
| num += 1 | ||
| visited[nxt] = True | ||
|
|
||
| for t in jobs[nxt]: | ||
| if not visited[t]: | ||
| queue.append(t) |
| return result | ||
|
|
||
|
|
||
| def check_graph(first, edge_info, visited, point): |
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.
📌 from issue #214 📌
📋문제 목록📋